id:A112379 - OEIS Search Results

Search: id:A112379

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
3

1, 2, 1, 3, 2, 1, 4, 1, 3, 2, 5, 1, 2, 4, 1, 3, 1, 6, 2, 3, 5, 1, 2, 1, 4, 2, 7, 1, 3, 4, 1, 6, 2, 3, 2, 5, 1, 3, 1, 8, 2, 1, 4, 5, 2, 7, 1, 3, 1, 4, 3, 6, 1, 2, 1, 4, 2, 9, 3, 2, 5, 1, 6, 3, 1, 8, 2, 4, 1, 2, 5, 4, 7, 2, 1, 3, 1, 2, 5, 1, 3, 1, 10, 4, 3, 6, 1, 2, 7, 1, 4, 2, 9, 3, 5, 2, 3, 1, 6 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`The sequence also gives the number of numbers that are retained between zeros that are dropped. Alternatively, each element is the number of numbers between 1's in the original sequence.`
	CROSSREFS	`Cf. A112377, A112380.` `Adjacent sequences: A112376 A112377 A112378 this_sequence A112380 A112381 A112382` `Sequence in context: A002341 A128260 A083368 this_sequence A073932 A082404 A120885`
	KEYWORD	`nonn,easy`
	AUTHOR	`Kerry Mitchell (lkmitch(AT)gmail.com), Dec 04 2005`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research