|
Search: id:A155914
|
|
|
| A155914 |
|
This is an all interval series, i.e. it is an all-interval 12 tone row. |
|
+0 1
|
|
| 0, 11, 7, 4, 2, 9, 3, 8, 10, 1, 5, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This is one of 3856 such sequences
|
|
REFERENCES
|
Robert Morris and Daniel Starr, The Structure of All-Interval Series, 1974, Yale University Department of Music.
http://strasheela.sourceforge.net/strasheela/doc/Example-AllIntervalSeries.html
|
|
PROGRAM
|
(Other) %% Oz %%CSP definition. AllIntervalSeries returns the all-interval series %% Xs, which is a list of pitch classes represented by finite domain (FD) %% integers. For convenience, also the list of intervals between the series %% pitches can be output (Dxs, also a list of FD integers). AllIntervalSeries %% expects the length of the series to generate as argument L (an integer).
%% proc {AllIntervalSeries L ?Dxs ?Xs} Xs = {FD.list L 0#L-1} % Xs is list of L FD integers in {0, ..., L-1} Dxs = {FD.list L-1 1#L-1} %% Loop constrains intervals: inversionalEquivalentInterval(X_i, X_i+1, Dx_i) for I in 1..L-1 do X1 = {Nth Xs I} X2 = {Nth Xs I+1} Dx = {Nth Dxs I} in {InversionalEquivalentInterval X1 X2 Dx} end {FD.distinctD Xs} % no PC repetition {FD.distinctD Dxs} % no interval repetition %% add knowledge from the literature: first series note is 0 and last is L/2 Xs.1 = 0 {List.last Xs} = L div 2 %% Search strategy: first fail distribution {FD.distribute ff Xs} end
|
|
CROSSREFS
|
Sequence in context: A109828 A048981 A132361 this_sequence A087896 A144262 A110093
Adjacent sequences: A155911 A155912 A155913 this_sequence A155915 A155916 A155917
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Craig Bourne (cbourne(AT)cbourne.com), Jan 30 2009
|
|
|
Search completed in 0.002 seconds
|