login
A290651
a(n) = 5 - 2^(n - 1) + 3^(n - 1) + n - 2.
0
4, 6, 11, 26, 73, 220, 675, 2070, 6317, 19184, 58039, 175114, 527361, 1586148, 4766603, 14316158, 42981205, 129009112, 387158367, 1161737202, 3485735849, 10458256076, 31376865331, 94134790246, 282412759293, 847255055040, 2541798719495, 7625463267290
OFFSET
1,1
COMMENTS
For n > 2, number of irredundant sets in the (n-2)-book graph.
LINKS
Eric Weisstein's World of Mathematics, Book Graph
Eric Weisstein's World of Mathematics, Irredundant Set
FORMULA
a(n) = 7*a(n-1) - 17*(n-2) + 17*a(n-3) - 6*a(n-4).
G.f.: (x (4 - 22 x + 37 x^2 - 17 x^3))/((-1 + x)^2 (1 - 5 x + 6 x^2)).
MATHEMATICA
Table[5 - 2^(n - 1) + 3^(n - 1) + n - 2, {n, 20}]
LinearRecurrence[{7, -17, 17, -6}, {4, 6, 11, 26}, 20]
CoefficientList[Series[(4 - 22 x + 37 x^2 - 17 x^3)/((-1 + x)^2 (1 - 5 x + 6 x^2)), {x, 0, 20}], x]
CROSSREFS
Sequence in context: A336343 A330459 A285994 * A358913 A066155 A105308
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Aug 08 2017
STATUS
approved