login
A087466
a(n) = number of the row (counting from initial row 0) of the array R in A087465 that contains n.
2
0, 0, 1, 0, 1, 0, 2, 1, 0, 2, 1, 3, 0, 2, 1, 3, 0, 2, 4, 1, 3, 0, 2, 4, 1, 3, 5, 0, 2, 4, 1, 3, 5, 0, 2, 4, 6, 1, 3, 5, 0, 2, 4, 6, 1, 3, 5, 7, 0, 2, 4, 6, 1, 3, 5, 7, 0, 2, 4, 6, 8, 1, 3, 5, 7, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 0, 2, 4, 6, 8, 10, 1, 3
OFFSET
1,7
COMMENTS
A sequence that contains itself as a proper subsequence (infinitely many times); that is, a fractal sequence.
LINKS
Clark Kimberling and John E. Brown, Partial Complements and Transposable Dispersions, J. Integer Seqs., Vol. 7, 2004.
EXAMPLE
Northwest corner of R:
1 2 4 6 9
3 5 8 11 15
7 10 14 18 23
12 16 21 26 32
19 24 30 36 43
a(10)=2 because 10 is in row 2.
CROSSREFS
Sequence in context: A025686 A215345 A022329 * A333211 A258033 A153248
KEYWORD
nonn
AUTHOR
Clark Kimberling, Sep 09 2003
STATUS
approved