|
Search: id:A110963
|
|
|
| A110963 |
|
Fractalisation of a fractal: of the Kimberling's sequence beginning with 1. |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 4, 1, 1, 1, 5, 3, 3, 2, 6, 2, 2, 1, 7, 4, 4, 1, 8, 1, 1, 1, 9, 5, 5, 3, 10, 3, 3, 2, 11, 6, 6, 2, 12, 2, 2, 1, 13, 7, 7, 4, 14, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
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 1. Also: -a(4n) = the natural numbers -a(4n+1)= the Kimberling's sequence (beginning with 1) -a(4n+2)= the Kimberling's sequence (beginning with 1) -a(4n+3)= the sequence itself -a(8n+1)=a(8n+2)= the natural numbers.
|
|
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 1). a(4n)=a(8n+1)=a(8n+2)= n.
|
|
CROSSREFS
|
Cf. A110812, A110779, A110766. Equals A110962 + 1.
Sequence in context: A107249 A062842 A126805 this_sequence A106348 A161092 A029332
Adjacent sequences: A110960 A110961 A110962 this_sequence A110964 A110965 A110966
|
|
KEYWORD
|
base,easy,nonn,uned
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Sep 26 2005
|
|
|
Search completed in 0.002 seconds
|
