|
|
A289255
|
|
a(n) = 4^n - 2*n - 1.
|
|
2
|
|
|
1, 11, 57, 247, 1013, 4083, 16369, 65519, 262125, 1048555, 4194281, 16777191, 67108837, 268435427, 1073741793, 4294967263, 17179869149, 68719476699, 274877906905, 1099511627735, 4398046511061, 17592186044371, 70368744177617, 281474976710607, 1125899906842573
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of dominating sets in the n-cocktail party graph.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 4^n - 2*n - 1.
a(n) = 6*a(n-1)-9*a(n-2)+4*a(n-3).
G.f.: ((-1 - 5*x)*x)/((-1 + x)^2*(-1 + 4*x)).
|
|
MATHEMATICA
|
Table[4^n - 2 n - 1, {n, 20}]
LinearRecurrence[{6, -9, 4}, {1, 11, 57}, 20]
CoefficientList[Series[(-1 - 5 x)/((-1 + x)^2 (-1 + 4 x)), {x, 0, 20}], x]
|
|
PROG
|
(PARI) Vec(x*(1 + 5*x) / ((1 - x)^2*(1 - 4*x)) + O(x^30)) \\ Colin Barker, Jun 30 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|