|
|
A059021
|
|
Number of 3 X n checkerboards (with at least one red square) in which the set of red squares is edge-connected.
|
|
5
|
|
|
0, 6, 40, 218, 1126, 5726, 28992, 146642, 741556, 3749816, 18961450, 95880894, 484833212, 2451616864, 12396892316, 62686360476, 316981037374, 1602852315476, 8105013367472, 40983964057352, 207240288658392
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Number of nonzero 3 X n binary arrays with all 1's connected. Equivalently, the number of connected (non-null) induced subgraphs in the grid graph P_3 X P_n. - Andrew Howroyd, May 20 2017
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 9a(n-1) - 26a(n-2) + 35a(n-3) - 22a(n-4) - 3a(n-5) + 16a(n-6) - 9a(n-7) + a(n-8). - David Radcliffe, Jan 19 2001
G.f.: -2*x*(x^5-4*x^4-3*x^3+7*x^2-7*x+3) / ((x-1)^2*(x^6-7*x^5+x^4+6*x^3-11*x^2+7*x-1)). - Colin Barker, Nov 06 2014
|
|
MATHEMATICA
|
Table[-7/4 - 3 n/2 - RootSum[-1 + 7 # - #^2 - 6 #^3 + 11 #^4 - 7 #^5 + #^6 &, -60219359 #^n + 44281168 #^(1 + n) + 293383797 #^(2 + n) - 152425571 #^(3 + n) - 51762232 #^(4 + n) + 12785939 #^(5 + n) &]/2083234808, {n, 20}] (* Eric W. Weisstein, Aug 09 2017 *)
LinearRecurrence[{9, -26, 35, -22, -3, 16, -9, 1}, {6, 40, 218, 1126, 5726, 28992, 146642, 741556}, 20] (* Eric W. Weisstein, Aug 09 2017 *)
|
|
PROG
|
(PARI) concat(0, Vec(-2*x*(x^5-4*x^4-3*x^3+7*x^2-7*x+3)/((x-1)^2*(x^6-7*x^5+x^4+6*x^3-11*x^2+7*x-1)) + O(x^100))) \\ Colin Barker, Nov 06 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|