|
Search: id:A132376
|
|
|
| A132376 |
|
Algorithmic drum function based on two bar 16 notes per bar: Funk drum : Based on Andy Newark "In Time" from Sly Stone's Fresh 1973". |
|
+0
1
|
|
| 5, 5, 2, 5, 2, 3, 5, 5, 2, 5, 2, 5, 2, 3, 3, 3, 5, 2, 4, 1, 3, 5, 2, 5, 5, 2, 2, 5, 5, 3, 3, 2, 5, 5, 2, 5, 2, 3, 5, 5, 2, 5, 2, 5, 2, 3, 3, 3, 5, 2, 4, 1, 3, 5, 2, 5, 5, 2, 2, 5, 5, 3, 3, 2, 5, 5, 2, 5, 2, 3, 5, 5, 2, 5, 2, 5, 2, 3, 3, 3, 5, 2, 4, 1, 3, 5, 2, 5, 5, 2, 2, 5, 5, 3, 3, 2, 5, 5, 2, 5, 2, 3, 5, 5, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The functions are sequences of drum choices: A-> Bass drum (1) B-> Snare Drum (2) C-> High hat closed with foot (3) D-> Open high hat struck with stick (4) E-> Closed High hat Struck with stick.
|
|
REFERENCES
|
Page 447 : Mark C. Gridley, "Jazz Styles;History and Analysis", 7th edition, ISBN 0 - 13 - 021227 - x, 200, published by Courier Kendallville
|
|
FORMULA
|
First "or" choice Function: f(n)=If[Mod[n, 32] == 0 || Mod[n, 32] == 3 || Mod[n, 32] == 5 || Mod[n, 32] == 11 ||Mod[n, 32] == 9 || Mod[n, 32] == 13 || Mod[n, 32] == 18 || Mod[n, 32] == 23 || Mod[n, 32] == 26 || Mod[n, 32] == 27, 2, g(n)]; Second Function: g(n)=If[Mod[n, 32] == 6 || Mod[n, 32] == 9 || Mod[n, 32] == 14 || Mod[n, 32] == 15 || Mod[n, 32] == 16 || Mod[n, 32] == 21 || Mod[n, 32] == 26 || Mod[n, 32] == 30 || Mod[n, 32] == 31, 3, h(n)]; Third Function: h(n)=If[Mod[n, 32] == 20, 1, k(n)]; Last Function: k(n)=If[Mod[n, 32] == 19, 4, 5]
|
|
MATHEMATICA
|
(*Funk drum : Based on Andy Newark "In Time" from Sly Stone's Fresh 1973"*) (* Page 447 : Mark C. Gridley, "Jazz Styles; History and Analysis", 7th edition, ISBN 0 - 13 - 021227 - x, 200, Courier Kendallville*) (*A*) f[n_] = If[Mod[n, 32] == 0 || Mod[n, 32] == 3 || Mod[n, 32] == 5 || Mod[n, 32] == 11 || Mod[n, 32] == 9 || Mod[n, 32] == 13 || Mod[n, 32] == 18 || Mod[n, 32] == 23 || Mod[n, 32] == 26 || Mod[n, 32] == 27, 2, g[n]]; (*B*) g[n_] = If[ Mod[n, 32] == 6 || Mod[n, 32] == 9 || Mod[n, 32] == 14 || Mod[n, 32] == 15 || Mod[ n, 32] == 16 || Mod[n, 32] == 21 || Mod[n, 32] == 26 || Mod[n, 32] == 30 || Mod[n, 32] == 31, 3, h[n]]; (*C*) h[n_] = If[Mod[n, 32] == 20, 1, k[n]]; (*D*) k[n_] = If[Mod[n, 32] == 19, 4, 5]; a = Table[f[n], {n, 1, 256}]
|
|
CROSSREFS
|
Adjacent sequences: A132373 A132374 A132375 this_sequence A132377 A132378 A132379
Sequence in context: A125642 A011335 A021185 this_sequence A019602 A023580 A021648
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 10 2007
|
|
|
Search completed in 0.002 seconds
|
