id:A112377 - OEIS Search Results

Search: id:A112377

Displaying 1-1 of 1 results found.

page 1

A self-descriptive fractal sequence: if 1 is subtracted from every term and any zero terms are omitted, the original sequence is recovered (this process may be called "lower trimming").

+0
7

1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 5, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 6, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`This sequence is also self-descriptive, in that each element gives the number of zeros that were removed before it. The indices where the sequence hits a new maximum value (2 at the 2nd position, 3 at the 5th position, 4 at the 13th, 5 at the 34th, etc.) are every second Fibonacci number.`
	CROSSREFS	`Cf. A112378, A112379, A112380, A000045, A112382.` `Sequence in context: A036036 A076259 A107359 this_sequence A127704 A050873 A128221` `Adjacent sequences: A112374 A112375 A112376 this_sequence A112378 A112379 A112380`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Kerry Mitchell (lkmitch(AT)gmail.com), Dec 04 2005`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research