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!)
A266844 Binary representation of the n-th iteration of the "Rule 70" elementary cellular automaton starting with a single ON (black) cell. 2
1, 110, 10100, 1101000, 101010000, 11010100000, 1010101000000, 110101010000000, 10101010100000000, 1101010101000000000, 101010101010000000000, 11010101010100000000000, 1010101010101000000000000, 110101010101010000000000000, 10101010101010100000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Rule 198 also generates this sequence.
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 05 2016 and Apr 18 2019: (Start)
a(n) = (2^(n-1)*(-9*(-50)^n-2*5^n+209*50^n))/99.
a(n) = 10*a(n-1)+10000*a(n-2)-100000*a(n-3) for n>2.
G.f.: (1+100*x-1000*x^2) / ((1-10*x)*(1-100*x)*(1+100*x)).
(End)
MATHEMATICA
rule=70; 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
Sequence in context: A063751 A266179 A163664 * A265319 A267854 A135645
KEYWORD
nonn,easy
AUTHOR
Robert Price, Jan 04 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 April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)