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!)
A267801 Binary representation of the n-th iteration of the "Rule 213" elementary cellular automaton starting with a single ON (black) cell. 2
1, 11, 10011, 1110011, 111110011, 11111110011, 1111111110011, 111111111110011, 11111111111110011, 1111111111111110011, 111111111111111110011, 11111111111111111110011, 1111111111111111111110011, 111111111111111111111110011, 11111111111111111111111110011 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
LINKS
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
FORMULA
Conjectures from Colin Barker, Jan 21 2016 and Apr 20 2019: (Start)
a(n) = 101*a(n-1)-100*a(n-2) for n>3.
G.f.: (1+10*x)*(1-100*x+10000*x^2) / ((1-x)*(1-100*x)).
(End)
MATHEMATICA
rule=213; rows=20; ca=CellularAutomaton[rule, {{1}, 0}, rows-1, {All, All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]], {rows-k+1, rows+k-1}], {k, 1, rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]]], {k, 1, rows}] (* Binary Representation of Rows *)
CROSSREFS
Cf. A267800.
Sequence in context: A286647 A267035 A204574 * A050647 A267054 A082265
KEYWORD
nonn,easy
AUTHOR
Robert Price, Jan 20 2016
STATUS
approved

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 March 28 10:31 EDT 2024. Contains 371240 sequences. (Running on oeis4.)