|
Search: id:A051932
|
|
|
| A051932 |
|
Number of independent sets of nodes in graph K_7 X C_n (n > 2). |
|
+0
1
|
|
| 8, 1, 57, 358, 2605, 18551, 132504, 946037, 6754805, 48229630, 344362257, 2458765387, 17555720008, 125348805401, 894997357857, 6390330310358, 45627309530405, 325781497023151, 2326097788692504, 16608466017870637
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
a(n) = 6*a(n-1) + 8*a(n-2) + a(n-3)
a(n)=6*(-1)^n+[7/2+(1/2)*sqrt(53)]^n+[7/2-(1/2)*sqrt(53)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2008
|
|
CROSSREFS
|
Sequence in context: A050302 A050401 A089276 this_sequence A038279 A075503 A051379
Adjacent sequences: A051929 A051930 A051931 this_sequence A051933 A051934 A051935
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Stephen G. Penrice (spenrice(AT)ets.org), Dec 19 1999
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 20 1999
Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 07 2006
|
|
|
Search completed in 0.002 seconds
|
