A087466 a(n) = number of the row (counting from initial row 0) of the array R in A087465 that contains n.

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

Table of n, a(n) for n=1..104.

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

Cf. A087465, A087467.

Sequence in context: A025686 A215345 A022329 * A333211 A258033 A153248

Adjacent sequences: A087463 A087464 A087465 * A087467 A087468 A087469

Keyword

nonn

Author

Clark Kimberling, Sep 09 2003

Status

approved