A135357 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A135357

Chord Progression graph substitution algorithm that give even odd on the p[7] tp p[6],but all twelve notes are covered: based on: C-> {F,G} is like D->{G,A} or 4->{9,11} is like 6->{11,1}.

6, 6, 6, 8, 6, 6, 6, 8, 6, 6, 6, 8, 8, 10, 8, 10, 6, 6, 6, 8, 6, 6, 6, 8, 6, 6, 6, 8, 8, 10, 8, 10, 6, 6, 6, 8, 6, 6, 6, 8, 6, 6, 6, 8, 8, 10, 8, 10, 8, 10, 8, 10, 10, 12, 10, 12, 8, 10, 8, 10, 10, 12, 10, 12, 8, 10, 8, 10, 10, 12, 10, 12, 8, 10, 8, 10, 10, 12, 10, 12, 10, 12, 10, 12, 12, 2, 12

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

It tends to repeat a lot and is not very interesting to the ear. If you start with {4,9,11} it doesn't alternate even-odd, but it also doesn't cover the twelve but misses {2,7} or Bb and Eb.

LINKS

Roger L. Bagula, Dec 08 2007, Table of n, a(n) for n = 1..576

CROSSREFS

Sequence in context: A131703 A352764 A329087 * A322346 A332559 A361871

Adjacent sequences: A135354 A135355 A135356 * A135358 A135359 A135360

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula, Dec 08 2007

STATUS

approved