|
|
A297663
|
|
a(n) = 5*n + 2^n.
|
|
5
|
|
|
1, 7, 14, 23, 36, 57, 94, 163, 296, 557, 1074, 2103, 4156, 8257, 16454, 32843, 65616, 131157, 262234, 524383, 1048676, 2097257, 4194414, 8388723, 16777336, 33554557, 67108994, 134217863, 268435596, 536871057, 1073741974, 2147483803, 4294967456, 8589934757
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also the number of chordless cycles in 2n-crossed prism graph for n >= 3.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3).
G.f.: (-1 - 3*x + 9*x^2)/((-1 + x)^2*(-1 + 2*x)).
|
|
MATHEMATICA
|
Table[5 n + 2^n, {n, 0, 20}]
LinearRecurrence[{4, -5, 2}, {7, 14, 23}, {0, 20}]
seq = CoefficientList[Series[(-1 - 3 x + 9 x^2)/((-1 + x)^2 (-1 + 2 x)), {x, 0, 20}], x]
|
|
PROG
|
(Magma) I:=[1, 7, 14]; [n le 3 select I[n] else 4*Self(n-1)- 5*Self(n-2)+2*Self(n-3): n in [1..40]]; // Vincenzo Librandi, Feb 21 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|