|
Search: id:A110962
|
|
|
| A110962 |
|
Fractalisation of a fractal: of the Kimberling's sequence beginning with 0. |
|
+0
2
|
|
| 0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 1, 0, 3, 0, 0, 0, 4, 2, 2, 1, 5, 1, 1, 0, 6, 3, 3, 0, 7, 0, 0, 0, 8, 4, 4, 2, 9, 2, 2, 1, 10, 5, 5, 1, 11, 1, 1, 0, 12, 6, 6, 3, 13, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
COMMENT
|
Self-descriptive sequence: even terms are the sequence itself, odd terms (the skeleton of this sequence) are the terms of the Kimberling's sequence beginning with 0. Also: -a(4n) = the nonnegative integers -a(4n+1)= the Kimberling's sequence (beginning with 0) -a(4n+2)= the Kimberling's sequence (beginning with 0) -a(4n+3)= the sequence itself -a(8n+1)=a(8n+2)= the nonnegative integers. Equals A110963-1.
|
|
LINKS
|
Clark Kimberling, Fractal sequences.
|
|
FORMULA
|
a(2n+1)=a(n)=a(4n+3) = terms of the sequence itself. a(2n)=a(4n+1)=a(4n+2) = terms of Kimberling's sequence (beginning with 0). a(4n)=a(8n+1)=a(8n+2)= n.
|
|
CROSSREFS
|
Cf. A110812, A110779, A110766, A110963.
Sequence in context: A123331 A114638 A123340 this_sequence A065715 A051628 A163540
Adjacent sequences: A110959 A110960 A110961 this_sequence A110963 A110964 A110965
|
|
KEYWORD
|
base,easy,nonn,uned
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Sep 26 2005
|
|
|
Search completed in 0.002 seconds
|
