cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Sep 09 2003

Keywords

Comments

A sequence that contains itself as a proper subsequence (infinitely many times); that is, a fractal sequence.

Examples

			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