|
|
A260846
|
|
a(n) = (-3 - 28*3^n + 73*15^n)/21.
|
|
1
|
|
|
2, 48, 770, 11696, 175874, 2639408, 39595010, 593936816, 8909087234, 133636413488, 2004546517250, 30068198703536, 451022983387394, 6765344759313968, 101480171415218690, 1522202571304807856, 22833038569801700354, 342495578547714252848, 5137433678217780035330
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(n) is the total number of holes at n iterations of a fractal starting with a pattern of 15 boxes and 2 nonsquare holes (see illustration in Links field).
|
|
LINKS
|
|
|
FORMULA
|
a(0) = 2, a(n) = 15*a(n-1) + 2 + 16*3^(n-1) for n > 0.
a(n) = 2*15^n + 2*Sum_{i=0..n-1} 15^i*(1 + 8*3^(n-1-i)).
G.f.: 2*(8*x^2-5*x-1) / ((x-1)*(3*x-1)*(15*x-1)). - Colin Barker, Aug 01 2015
a(n) = 19*a(n-1) - 63*a(n-2) + 45*a(n-3) for n>2. - Colin Barker, Aug 20 2015
|
|
MATHEMATICA
|
LinearRecurrence[{19, -63, 45}, {2, 48, 770}, 20] (* Harvey P. Dale, Apr 18 2020 *)
|
|
PROG
|
(PARI) {for (n=0, 100, s=0; for (i=0, n-1, s=s+2*15^i*(1+8*3^(n-1-i))); a=s+2*15^n; print1(a, ", "))}
(PARI) Vec(2*(8*x^2-5*x-1)/((x-1)*(3*x-1)*(15*x-1)) + O(x^20)) \\ Colin Barker, Aug 01 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|