OFFSET
0,2
COMMENTS
Analog of A160720, but here we are working on the triangular lattice.
The first differences (A256257) gives the number of triangular cells turned ON at every generation.
Also 6 times the sum of all entries in rows 0 to n of Sierpiński's triangle A047999.
Also 6 times the total number of odd entries in first n rows of Pascal's triangle A007318, see formula section.
The structure contains three distinct kinds of polygons formed by triangular ON cells: the initial hexagon, rhombuses (each one formed by two ON cells) and unit triangles.
Note that if n is a power of 2 greater than 2, the structure looks like concentric hexagons with triangular holes, where some of them form concentric stars.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..16386
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Identities and periodic oscillations of divide-and-conquer recurrences splitting at half, arXiv:2210.10968 [cs.DS], 2022, p. 30.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
FORMULA
a(n) = 6*A006046(n).
EXAMPLE
On the infinite triangular grid we start with all triangular cells turned OFF, so a(0) = 0.
At stage 1, in the structure there are six triangular cells turned ON forming a regular hexagon, so a(1) = 6.
At stage 2, there are 12 new triangular ON cells forming six rhombuses around the initial hexagon, so a(2) = 6 + 12 = 18.
And so on.
MATHEMATICA
Prepend[6*FoldList[Plus, 0, Total /@ CellularAutomaton[90, Join[Table[0, {#}], {1}, Table[0, {#}]], #]][[2 ;; -1]], 0] &[63] (* Michael De Vlieger, Nov 03 2022, after Bradley Klee at A006046 *)
PROG
(PARI) a(n) = 6*sum(j=0, n, sum(k=0, j, binomial(j, k) % 2)); \\ Michel Marcus, Apr 01 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Mar 20 2015
STATUS
approved