Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M0608 #27 Oct 04 2017 00:53:26
%S 1,2,3,5,5,8,13,13,13,26,13,91,13,106,106,75,93,62,80,132,337,416,62,
%T 62,62,271,34,155,525,548,1084,115,62,558,62,1500,2922,124,2958,3374,
%U 2323,4183,8073,7925,744,2298,434,6700,310,23796,12732,26405
%N Consider a 2-D cellular automaton generated by the Schrandt-Ulam rule of A170896, but confined to a semi-infinite strip of width n, starting with one ON cell at the top left corner; a(n) is the period of the resulting structure.
%C Schrandt and Ulam remark that there seems to be no simple relation between n and a(n).
%C The original report included two further terms, but they were omitted from the published version, so are presumably unreliable.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H J. T. Butler, <a href="/A006447/a006447.pdf">Letter to N. J. A. Sloane, Jun. 1975</a>.
%H R. G. Schrandt and S. M. Ulam, <a href="http://library.lanl.gov/cgi-bin/getfile?00359037.pdf">On recursively defined geometric objects and patterns of growth</a>, Los Alamos Scientific Laboratory, Report LA-3762, Aug 16 1967; published in A. W. Burks, editor, Essays on Cellular Automata. Univ. Ill. Press, 1970, pp. 238ff. [Link supplied by Laurinda J. Alcorn, Jan 09 2010]
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%K nonn
%O 1,2
%A _N. J. A. Sloane_
%E Entry revised by _N. J. A. Sloane_, Jan 09 2010
%E More terms from _Sean A. Irvine_, Apr 13 2017