|
|
A160119
|
|
A three-dimensional version of the cellular automaton A160118, using cubes.
|
|
6
|
|
|
0, 1, 27, 35, 235, 243, 443, 499, 1899, 1907, 2107, 2163, 3563, 3619, 5019, 5411, 15211, 15219, 15419, 15475, 16875, 16931, 18331, 18723, 28523, 28579, 29979, 30371, 40171, 40563, 50363, 53107, 121707, 121715, 121915, 121971, 123371, 123427, 124827, 125219, 135019
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Each cell has 26 neighbors.
|
|
LINKS
|
|
|
FORMULA
|
a(2n-1) = 27 + 8*Sum_{k=1..n-1}A151785(k) + 200*Sum_{k=1..n-2}A151785(k), n >= 2.
a(2n) = 27 + 8*Sum_{k=1..n-1}A151785(k) + 200*Sum_{k=1..n-1}A151785(k), n >= 1.
In general, a d-dimensional version of the cellular automaton A160118 has its cell count given by the following formulas (where wt(k) = A000120(k)):
a(2n-1) = 3^d + (2^d)*Sum_{k=1..n-1}(2^d-1)^(wt(k)-1) + (2^d)*(3^d-2)*Sum_{k=1..n-2}(2^d-1)^(wt(k)-1), n >= 2.
a(2n) = 3^d + (2^d)*Sum_{k=1..n-1}(2^d-1)^(wt(k)-1) + (2^d)*(3^d-2)*Sum_{k=1..n-1}(2^d-1)^(wt(k)-1), n >= 1. (End)
|
|
MATHEMATICA
|
With[{d = 3}, wt[n_] := DigitCount[n, 2, 1]; a[n_] := If[OddQ[n], 3^d + (2^d)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 1)/2}] + (2^d)*(3^d - 2)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 3)/2}], 3^d + (2^d)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}] + (2^d)*(3^d - 2)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}]]; a[0] = 0; a[1] = 1; Array[a, 50, 0]] (* Amiram Eldar, Aug 01 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|