login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087467 a(n) = number of the row (counting from initial row 1) of the array R in A087465 that contains n. 1
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

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.

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: A023130 A084532 A134583 * A128118 A205696 A029635

Adjacent sequences:  A087464 A087465 A087466 * A087468 A087469 A087470

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Sep 09 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.