login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086993 Number of generations needed to reach an oscillator, starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment). 3

%I #15 Mar 11 2022 07:34:39

%S 1,1,2,3,4,5,5,6,11,9,10,10,13,17,19,21,33,30,22,22,64,74,25,24,83,97,

%T 40,45,215,227,223,348,128,510,51,53,115,1429,1581,337,4435,425,4791,

%U 5564

%N Number of generations needed to reach an oscillator, starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment).

%C LongLife rule: birth occurs if dead cell has 3,4 or 5 neighbors. Survival occurs if live cell has 5 neighbors. (Sequence computed using LifeLab for Macintosh.)

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GameofLife.html">Game of Life</a>

%Y Cf. A086973 (oscillator period).

%K nonn,more

%O 1,3

%A _Benoit Cloitre_, Sep 22 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:38 EDT 2024. Contains 371794 sequences. (Running on oeis4.)