|
|
A244873
|
|
Number of magic labelings of the prism graph I X C_7 with magic sum n.
|
|
14
|
|
|
1, 29, 289, 1640, 6604, 21122, 57271, 137155, 298184, 599954, 1132942, 2029229, 3475465, 5728289, 9132418, 14141618, 21342771, 31483251, 45501823, 64563278, 90097018, 123839804, 167882881, 224723693, 297322402, 389163424, 504322196, 647537387, 824288767, 1040880947, 1304533204
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The graph is the 5th one shown in the link. This sequence is also the number of magic labelings of the cycle-of-loops graph LOOP X C_7 with magic sum n, where LOOP is the 1-vertex, 1-loop-edge graph. A similar identity holds between the sequences for I X C_k and LOOP X C_k for all odd k. - David J. Seal, Sep 14 2017
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1+22*x+106*x^2+169*x^3+106*x^4+22*x^5+x^6)/((1-x)^8*(1+x)).
a(n) = 61*n^7/1440 + 427*n^6/960 + 1463*n^5/720 + 2009*n^4/384 + 11809*n^3/1440 + 1253*n^2/160 + 169*n/40 + (-1)^n/256 + 255/256. [Bruno Berselli, Jul 08 2014]
|
|
MATHEMATICA
|
Table[61 n^7/1440 + 427 n^6/960 + 1463 n^5/720 + 2009 n^4/384 + 11809 n^3/1440 + 1253 n^2/160 + 169 n/40 + (-1)^n/256 + 255/256, {n, 0, 30}] (* Bruno Berselli, Jul 08 2014 *)
LinearRecurrence[{7, -20, 28, -14, -14, 28, -20, 7, -1}, {1, 29, 289, 1640, 6604, 21122, 57271, 137155, 298184}, 40] (* Harvey P. Dale, Aug 09 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|