login
A285396
Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 2; a(n) is the number of cells after n iterations.
10
1, 21, 399, 7401, 136227, 2500437, 45845895, 840237393, 15396839067, 282119272221, 5169192919455, 94712719519353, 1735370171447763, 31796203000166949, 582583421696631159, 10674336158022192609, 195579614965832408523, 3583490696858688375405
OFFSET
0,2
COMMENTS
Cell configuration converges to a fractal with dimension 2.647...
FORMULA
a(0) = 1, a(1) = 21, a(2) = 399, a(n) = 28*a(n-1) - 195*a(n-2) + 324*a(n-3).
G.f.: (1-7*x+6*x^2)/(1-28*x+195*x^2-324*x^3).
MATHEMATICA
LinearRecurrence[{28, -195, 324}, {1, 21, 399}, 20]
PROG
(Magma) I:=[1, 21, 399]; [n le 3 select I[n] else 28*Self(n-1) - 195*Self(n-2) + 324*Self(n-3) : n in [1..41]]; // G. C. Greubel, Dec 10 2021
(Sage)
def A285396_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( (1-7*x+6*x^2)/(1-28*x+195*x^2-324*x^3) ).list()
A285396_list(40) # G. C. Greubel, Dec 10 2021
KEYWORD
nonn,easy
AUTHOR
Peter Karpov, Apr 19 2017
STATUS
approved