This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112377 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"). 6
 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; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 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. LINKS MATHEMATICA lowertrim[list_] := DeleteCases[list - 1, 0]; Nest[Flatten[Append[#, {ConstantArray[1, #[[Length[lowertrim[#]] + 1]]], #[[Length[lowertrim[#]] + 1]] + 1}]] &, {1, 2}, 15] (* Birkas Gyorgy, Apr 27 2011 *) CROSSREFS Cf. A112378, A112379, A112380, A000045, A112382. Sequence in context: A076259 A260533 A107359 * A277760 A127704 A050873 Adjacent sequences:  A112374 A112375 A112376 * A112378 A112379 A112380 KEYWORD nonn,easy,nice AUTHOR Kerry Mitchell, Dec 04 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 23 14:17 EDT 2019. Contains 321431 sequences. (Running on oeis4.)