OFFSET
0,2
COMMENTS
a(n) is also the number of total dominating sets in the complete tripartite graph K_{n,n,n} for n > 0.
LINKS
Eric Weisstein's World of Mathematics, Complete Tripartite Graph
Eric Weisstein's World of Mathematics, Total Dominating Set
Index entries for linear recurrences with constant coefficients, signature (11,-26,16).
FORMULA
a(n) = A291703(n) for n > 1.
a(n) = 11*a(n-1) - 26*a(n-2) + 16*a(n-3).
G.f.: -2*x*(2 + 5*x)/(-1 + 11*x - 26*x^2 + 16*x^3).
MATHEMATICA
Table[(2^n - 1)^2 (2^n + 2), {n, 0, 30}]
LinearRecurrence[{11, -26, 16}, {4, 54, 490}, {0, 20}]
CoefficientList[Series[-((2 x (2 + 5 x))/(-1 + 11 x - 26 x^2 + 16 x^3)), {x, 0, 20}], x]
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Apr 16 2018
STATUS
approved