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

1, 1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 4, 1, 3, 2, 4, 1, 3, 5, 2, 4, 1, 3, 5, 2, 4, 6, 1, 3, 5, 2, 4, 6, 1, 3, 5, 7, 2, 4, 6, 1, 3, 5, 7, 2, 4, 6, 8, 1, 3, 5, 7, 2, 4, 6, 8, 1, 3, 5, 7, 9, 2, 4, 6, 8, 1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 2

Offset

1,3

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..103.

Clark Kimberling and John E. Brown, Partial Complements and Transposable Dispersions, J. Integer Seqs., Vol. 7, 2004.

Formula

A087466(n)+1

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)=3 because 10 is in row 3.

Crossrefs

Cf. A087465, A087466.

Sequence in context: A084532 A191476 A134583 * A231568 A327525 A327540

Adjacent sequences: A087464 A087465 A087466 * A087468 A087469 A087470

Keyword

nonn

Author

Clark Kimberling, Sep 09 2003

Status

approved