The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

%I

%S 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,

%T 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,

%U 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

%N 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").

%C 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.

%t lowertrim[list_] := DeleteCases[list - 1, 0];

%t Nest[Flatten[Append[#, {ConstantArray[1, #[[Length[lowertrim[#]] + 1]]], #[[Length[lowertrim[#]] + 1]] + 1}]] &, {1, 2}, 15] (* _Birkas Gyorgy_, Apr 27 2011 *)

%Y Cf. A112378, A112379, A112380, A000045, A112382.

%K nonn,easy,nice

%O 0,2

%A _Kerry Mitchell_, Dec 04 2005

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 August 4 13:48 EDT 2020. Contains 336201 sequences. (Running on oeis4.)