id:A087467 - OEIS Search Results

Search: id:A087467

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,3`
	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.`
	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: A084822 A023130 A084532 this_sequence A134583 A128118 A107456` `Adjacent sequences: A087464 A087465 A087466 this_sequence A087468 A087469 A087470`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Sep 09 2003`

page 1

Search completed in 0.005 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research