|
Search: id:A135692
|
|
|
| A135692 |
|
Scaled by 2 version of Per Norgard recursion. |
|
+0
1
|
|
| 0, 1, -2, -4, 4, 6, 8, 6, -8, -2, -12, -8, -16, -32, -12, -16, 16, 12, 4, 8, 24, 52, 16, 4, 32, 52, 64, 56, 24, 40, 32, 64, -32, -72, -24, -16, -8, -72, -16, -8, -48, -32, -104, -112, -32, -64, -8, -64, -64, 8, -104, -80, -128, -184, -112, -152, -48, -72, -80, -64, -64, 0, -128, -160, 64, 80, 144, 80, 48, 240, 32, 112, 16, -80
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Here the scale is a=2:
These chaotic types can also be scaled by integers as:
p(i) = If[Mod[i, 2] == 0, p(i - 2) - a*(p(Floor[i/2]) - p(Abs[Floor[i/2] - 1])), p[i - 1] - a*(p(Abs[Floor[i/2] - 2)] - p(Abs[Floor[i/2] - 3]))]
where a is an integer a=1,2,3,..
The composer Per Norgard's name is also written in the OEIS as Per Noergaard.
|
|
REFERENCES
|
web page:http ://www.pernoergaard.dk/eng/strukturer/uendelig/ukonstruktion05.html: Per Norgard recursion Programming
|
|
FORMULA
|
p(i) = If[Mod[i, 2] == 0, p(i - 2) - 2*(p(Floor[i/2]) - p(Abs[Floor[i/2] - 1])), p[i - 1] - 2*(p(Abs[Floor[i/2] - 2)] - p(Abs[Floor[i/2] - 3]))]
|
|
MATHEMATICA
|
p[0] = 0; p[1] = 1; p[2] = -1; p[3] = -2; p[i_] := p[i] = If[Mod[i, 2] == 0, p[i - 2] - (p[Floor[i/2]] - p[Abs[Floor[i/2] - 1]]), p[i - 1] - (p[Abs[Floor[i/2] - 2]] - p[Abs[Floor[i/2] - 3]])]; b = Table[p[n], {n, 0, 100}]
|
|
CROSSREFS
|
Sequence in context: A014246 A026413 A038669 this_sequence A089003 A132118 A007843
Adjacent sequences: A135689 A135690 A135691 this_sequence A135693 A135694 A135695
|
|
KEYWORD
|
uned,sign
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 21 2008
|
|
|
Search completed in 0.002 seconds
|
