|
Search: id:A109501
|
|
|
| A109501 |
|
Number of closed walks of length n on the complete graph on 7 nodes from a given node. |
|
+0
9
|
|
| 1, 0, 6, 30, 186, 1110, 6666, 39990, 239946, 1439670, 8638026, 51828150, 310968906, 1865813430, 11194880586, 67169283510, 403015701066, 2418094206390, 14508565238346, 87051391430070, 522308348580426
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
General form: k=6^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A015540 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
FORMULA
|
G.f. = (-1 + 5*z)/(-1 + 5*z + 6*z^2)
a(n) = (6^n + 6*(-1)^n)/7
|
|
MATHEMATICA
|
k=0; lst={k}; Do[k=6^n-k; AppendTo[lst, k], {n, 1, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
CROSSREFS
|
Cf. A109502.
Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A015540 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
Sequence in context: A001473 A063888 A029571 this_sequence A147517 A005922 A057896
Adjacent sequences: A109498 A109499 A109500 this_sequence A109502 A109503 A109504
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Mitch Harris (harris.mitchell (AT) mgh.harvard.edu), Jun 30 2005
|
|
EXTENSIONS
|
Corrected by Frank Adams-Watters (FrankTAW(AT)Netscape.net), Sep 18 2006
|
|
|
Search completed in 0.002 seconds
|
