id:A003603 - OEIS Search Results

Search: id:A003603

Displaying 1-1 of 1 results found.

page 1

Fractal sequence obtained from Fibonacci numbers (or Wythoff array).
(Formerly M0138)

+0
4

1, 1, 1, 2, 1, 3, 2, 1, 4, 3, 2, 5, 1, 6, 4, 3, 7, 2, 8, 5, 1, 9, 6, 4, 10, 3, 11, 7, 2, 12, 8, 5, 13, 1, 14, 9, 6, 15, 4, 16, 10, 3, 17, 11, 7, 18, 2, 19, 12, 8, 20, 5, 21, 13, 1, 22, 14, 9, 23, 6, 24, 15, 4, 25, 16, 10, 26, 3, 27, 17, 11, 28, 7, 29, 18, 2, 30, 19, 12, 31, 8, 32, 20, 5, 33 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`C. Kimberling, Numeration systems and fractal sequences, Acta Arithmetica 73 (1995) 103-117.`
	LINKS	`C. Kimberling, Fractal sequences` `N. J. A. Sloane, Classic Sequences`
	FORMULA	`Vertical para-budding sequence: says which row of Wythoff array (starting row count at 1) contains n.` `If delete first occurrence of 1, 2, 3, ... the sequence is unchanged.`
	CROSSREFS	`Equals A019586(n) + 1. Cf. A003602.` `Adjacent sequences: A003600 A003601 A003602 this_sequence A003604 A003605 A003606` `Sequence in context: A049085 A007336 A133334 this_sequence A135227 A104325 A133084`
	KEYWORD	`nonn,easy,nice,eigen`
	AUTHOR	`njas, Mira Bernstein`
	EXTENSIONS	`More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 29 2003`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research