|
|
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}.
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|