OFFSET
0,2
COMMENTS
LINKS
Robert Price, Table of n, a(n) for n = 0..500
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
Index entries for linear recurrences with constant coefficients, signature (0,17,0,-16).
FORMULA
From Colin Barker, Dec 30 2015 and Apr 15 2019: (Start)
a(n) = ((-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+7*x-17*x^2+8*x^3+16*x^4) / ((1-x)*(1+x)*(1-4*x)*(1+4*x)).
(End)
a(n) = (2*4^n-1)*(n mod 2) + 0^n. - Karl V. Keller, Jr., Jul 06 2021
MATHEMATICA
rule=23; 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 *)
PROG
(Python) print([(2*4**n-1)*(n%2) + 0**n for n in range(33)]) # Karl V. Keller, Jr., Jul 06 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Robert Price, Dec 29 2015
STATUS
approved