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.

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

Original entry on oeis.org

1, 2, 4, 107, 16, 1967, 64, 32447, 256, 523007, 1024, 8383487, 4096, 134197247, 16384, 2147401727, 65536, 34359410687, 262144, 549754503167, 1048576, 8796087779327, 4194304, 140737467383807, 16777216, 2251799729799167, 67108864, 36028796683419647, 268435456
Offset: 0

Views

Author

Robert Price, Dec 22 2015

Keywords

References

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

Crossrefs

Programs

  • Mathematica
    rule = 5; rows = 30; Table[FromDigits[Table[Take[CellularAutomaton[rule,{{1},0}, rows-1, {All,All}][[k]], {rows-k+1, rows+k-1}], {k,1,rows}][[k]],2], {k,1,rows}]
  • Python
    print([2*4**n -5*2**(n-1) -1 if n%2 else 2**n for n in range(30)]) # Karl V. Keller, Jr., Jun 20 2021

Formula

From Colin Barker, Dec 23 2015 and Apr 13 2019: (Start)
a(n) = 21*a(n-2) - 84*a(n-4) + 64*a(n-6) for n>5.
G.f.: (1+2*x-17*x^2+65*x^3+16*x^4-112*x^5) / ((1-x)*(1+x)*(1-2*x)*(1+2*x)*(1-4*x)*(1+4*x)).
(End)
a(n) = 2^n = A000079(n) for even n>=0; a(n) = 2*4^n - 5*2^(n-1) - 1 = A188530(n) for odd n. - Karl V. Keller, Jr., Jun 19 2021