id:A087466 - OEIS Search Results

Search: id:A087466

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`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.`
	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: A025657 A025686 A022329 this_sequence A153248 A153247 A071432` `Adjacent sequences: A087463 A087464 A087465 this_sequence A087467 A087468 A087469`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Sep 09 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research