Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132150 Semi-chaotic Jazz function ( Oscar Peterson robot function) on 13 tones: a[n]->a[n-1]+/- 3 0r 4 without 5 and 10 modulo 13. +0
2
4, 11, 1, 7, 3, 3, 11, 4, 7, 1, 9, 9, 4, 11, 1, 7, 2, 3, 11, 4, 7, 13, 8, 9, 4, 9, 13, 6, 1, 2, 9, 3, 6, 12, 7, 8, 3, 9, 12, 4, 13, 1, 9, 2, 4, 11, 6, 7, 2, 8, 11, 4, 12, 13, 8, 1, 4, 9, 4, 6, 1, 7, 9, 3, 11, 12, 7, 13, 3, 9, 4, 4, 13, 6, 9, 2, 9, 11, 6, 12, 2, 8, 3, 4, 12, 4, 8, 1, 9, 9, 4, 11, 1, 7, 2 (list; graph; listen)
OFFSET

1,1

COMMENT

Mixing the audio from this function with Oscar Peterson recordings doesn't produce any major length discords: sounds like a Jazz session.

FORMULA

Plus or minus 3 or 4: f(x)= x + 3*(2*Mod[x, 3] - 1) + Mod[x, 2]; Modulo 13: g(x)= If[f(x) > 12, 1 + Mod[f(x), 13], f(x)]; Modulo 5 equals zero removed: h(x) = If[Mod[g(x), 5] == 0, g(x) - 1, g(x)] a(n) = h(n)

MATHEMATICA

f[x_] := x + 3*(2*Mod[x, 3] - 1) + Mod[x, 2]; g[x_] := If[f[x] > 12, 1 + Mod[f[x], 13], f[x]]; h[x_] := If[Mod[g[x], 5] == 0, g[x] - 1, g[x]]; a = Table[h[x], {x, 1, 256}]

CROSSREFS

Sequence in context: A085649 A048873 A091390 this_sequence A091389 A113249 A087171

Adjacent sequences: A132147 A132148 A132149 this_sequence A132151 A132152 A132153

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research