%I #16 Jan 22 2022 08:38:54
%S 0,1,9,21,45,57,85,121,177,189,217,253,329,373,465,557,721,737,765,
%T 801,877,921,1013,1105,1301,1377,1485,1601,1805,1985,2221,2449,2873,
%U 2909,2937,2973,3049,3093,3185,3277,3473,3549,3657,3773,3977,4157,4393,4621,5113
%N a(n) is the total number of ON cells at stage n of a cellular automaton where cells are turned ON when they have one or two neighbors ON (see Comments for precise definition).
%C On the infinite square grid, start with all cells OFF.
%C Turn a single cell to the ON state.
%C At each subsequent step, each cell with exactly one or two neighbors ON is turned ON, and everything that is already ON remains ON.
%C Here "neighbor" refers to the eight adjacent and diagonally adjacent cells in the Moore neighborhood.
%H Rémy Sigrist, <a href="/A350632/a350632.png">Log periodic coloring of the structure at stage 512</a>
%H Rémy Sigrist, <a href="/A350632/a350632_1.txt">C++ program for A350632</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%e The first 5 generations can be depicted as follows:
%e . . . . . . . . . . .
%e . 5 5 . . . . . 5 5 .
%e . 5 4 4 4 4 4 4 4 5 .
%e . . 4 3 3 . 3 3 4 . .
%e . . 4 3 2 2 2 3 4 . .
%e . . 4 . 2 1 2 . 4 . .
%e . . 4 3 2 2 2 3 4 . .
%e . . 4 3 3 . 3 3 4 . .
%e . 5 4 4 4 4 4 4 4 5 .
%e . 5 5 . . . . . 5 5 .
%e . . . . . . . . . . .
%e - so a(0) = 0,
%e a(1) = 0 + 1 = 1,
%e a(2) = 1 + 8 = 9,
%e a(3) = 9 + 12 = 21,
%e a(4) = 21 + 24 = 45,
%e a(5) = 45 + 12 = 57.
%o (C++) See Links section.
%Y Cf. A147562, A151725, A160414, A256530, A350633, A350639.
%K nonn
%O 0,3
%A _Rémy Sigrist_, Jan 08 2022
|