|
|
A160722
|
|
Number of "ON" cells at n-th stage in a certain 2-dimensional cellular automaton based on Sierpinski triangles (see Comments for precise definition).
|
|
8
|
|
|
0, 1, 5, 9, 19, 23, 33, 43, 65, 69, 79, 89, 111, 121, 143, 165, 211, 215, 225, 235, 257, 267, 289, 311, 357, 367, 389, 411, 457, 479, 525, 571, 665, 669, 679, 689, 711, 721, 743, 765, 811, 821, 843, 865, 911, 933, 979, 1025, 1119, 1129, 1151, 1173, 1219, 1241
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
This cellular automata is formed by the concatenation of three Sierpinski triangles, starting from a central vertex. Adjacent polygons are fused. The ON cells are triangles, but we only count after fusion. The sequence gives the number of polygons at the n-th round.
If instead we start from four Sierpinski triangles we get A160720.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
We start at round 0 with no polygons, a(0) = 0.
At round 1 we turn ON the first triangle in each of the three Sierpinski triangles. After fusion we have a concave pentagon, so a(1) = 1.
At round 2 we turn ON two triangles in each the three Sierpinski triangles. After fusions we have the concave pentagon and four triangles. So a(2) = 1 + 4 = 5.
|
|
MATHEMATICA
|
a[0] = 0; a[1] = 1; a[n_] := a[n] = 2 a[Floor[#]] + a[Ceiling[#]] &[n/2]; Array[3 a[#] - 2 # &, 54, 0] (* Michael De Vlieger, Nov 01 2022 *)
|
|
CROSSREFS
|
A160723 gives the first differences.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|