|
%I #7 Mar 08 2015 20:00:29
%S 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,
%T 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,
%U 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
%N 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}.
%C 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.
%H Roger L. Bagula, Dec 08 2007, <a href="/A135357/b135357.txt">Table of n, a(n) for n = 1..576</a>
%K nonn,uned
%O 1,1
%A _Roger L. Bagula_, Dec 08 2007
|
