id:A112380 - OEIS Search Results

Search: id:A112380

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, 1, 3, 2, 1, 2, 1, 4, 1, 1, 1, 3, 2, 3, 1, 1, 2, 5, 1, 2, 1, 1, 2, 2, 1, 4, 1, 1, 1, 1, 3, 4, 2, 2, 1, 3, 1, 6, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 3, 3, 1, 1, 1, 2, 5, 2, 1, 2, 1, 2, 1, 1, 2, 4, 1, 1, 1, 1, 1, 5, 3, 3, 2, 4, 1, 2, 1, 1, 7, 2, 1, 3, 1, 2, 1, 1, 2, 2, 1, 1, 4, 3, 1, 3, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Each element also gives the number of zeros dropped before it and the number of elements written before the next zero.`
	CROSSREFS	`Cf. A112377, A112379.` `Sequence in context: A098805 A049286 A079216 this_sequence A125106 A141110 A025831` `Adjacent sequences: A112377 A112378 A112379 this_sequence A112381 A112382 A112383`
	KEYWORD	`nonn,easy`
	AUTHOR	`Kerry Mitchell (lkmitch(AT)gmail.com), Dec 04 2005`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research