|
Search: id:A125161
|
|
| |
|
| 1, 2, 3, 1, 4, 2, 5, 6, 7, 3, 8, 9, 1, 10, 4, 11, 12, 13, 14, 2, 15, 5, 16, 17, 6, 18, 19, 7, 20, 3, 21, 22, 23, 8, 24, 25, 26, 9, 27, 1, 28, 29, 10, 30, 4, 31, 32, 11, 33, 34, 12, 35, 36, 13, 37, 38, 14, 39, 40, 2, 41, 42, 43, 15, 44, 45, 46, 5, 16, 47, 48, 17
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If you delete the first occurrence of each n, the remaining sequence is the original sequence; thus the sequence contains itself as a proper subsequence (infinitely many times).
|
|
REFERENCES
|
C. Kimberling, "Interspersions and fractal sequences associated with fractions (c^j)/(d^k)," preprint, 2006.
|
|
LINKS
|
C. Kimberling, Fractal Sequences.
|
|
FORMULA
|
a(n)=number of the row of array A125153 that contains n.
|
|
EXAMPLE
|
1 is in row 1 of A125153; 2 in row 2; 3 in row 3;
4 in row 1; 5 in row 4; 6 in row 2, so the fractal
sequence starts with 1,2,3,1,4,2
|
|
CROSSREFS
|
Cf. A125153.
Sequence in context: A026276 A152201 A120873 this_sequence A125933 A011857 A006021
Adjacent sequences: A125158 A125159 A125160 this_sequence A125162 A125163 A125164
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 21 2006
|
|
|
Search completed in 0.002 seconds
|
