Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087469
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087469 a(n) = number of the row (counting from initial row 0) of the array R in A087468 that contains n. +0
2
0, 1, 0, 2, 1, 3, 0, 2, 4, 1, 3, 0, 5, 2, 4, 1, 6, 3, 0, 5, 2, 7, 4, 1, 6, 3, 0, 8, 5, 2, 7, 4, 1, 9, 6, 3, 0, 8, 5, 2, 10, 7, 4, 1, 9, 6, 3, 0, 11, 8, 5, 2, 10, 7, 4, 1, 12, 9, 6, 3, 0, 11, 8, 5, 2, 13, 10, 7, 4, 1, 12, 9, 6, 3, 0, 14, 11, 8, 5, 2, 13, 10, 7, 4, 1, 15, 12, 9, 6, 3, 0, 14, 11, 8, 5, 2, 16 (list; graph; listen)
OFFSET

1,4

COMMENT

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 3 7 12 19

2 5 10 16 24

4 8 14 21 30

6 11 18 26 36

9 15 23 32 43

a(11)=3 because 11 is in row 3.

CROSSREFS

Cf. A087468, A087470.

Sequence in context: A104512 A131848 A035157 this_sequence A022328 A025641 A025649

Adjacent sequences: A087466 A087467 A087468 this_sequence A087470 A087471 A087472

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.004 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research