cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A266255 Decimal representation of the n-th iteration of the "Rule 11" elementary cellular automaton starting with a single ON (black) cell.

Original entry on oeis.org

1, 4, 3, 124, 3, 2044, 3, 32764, 3, 524284, 3, 8388604, 3, 134217724, 3, 2147483644, 3, 34359738364, 3, 549755813884, 3, 8796093022204, 3, 140737488355324, 3, 2251799813685244, 3, 36028797018963964, 3, 576460752303423484, 3, 9223372036854775804, 3
Offset: 0

Views

Author

Robert Price, Dec 25 2015

Keywords

Comments

Rule 43 also generates this sequence.

References

  • S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

Crossrefs

Programs

  • Mathematica
    rule=11; 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]],2],{k,1,rows}]   (* Decimal Representation of Rows *)
  • Python
    print([2*4**n - 4 if n%2 else 3 - 2*0**n for n in range(33)]) # Karl V. Keller, Jr., Aug 26 2021

Formula

From Colin Barker, Dec 27 2015 and Apr 14 2019: (Start)
a(n) = (7*(-1)^n+2^(2*n+1)-(-1)^n*2^(2*n+1)-1)/2 for n>0.
a(n) = 17*a(n-2)-16*a(n-4) for n>4.
G.f.: (1+4*x-14*x^2+56*x^3-32*x^4) / ((1-x)*(1+x)*(1-4*x)*(1+4*x)).
(End)
a(n) = 2*4^n - 4 for odd n; a(n) = 3 - 2*0^n for even n. - Karl V. Keller, Jr., Aug 26 2021