|
Search: id:A109500
|
|
|
| A109500 |
|
Number of closed walks of length n on the complete graph on 6 nodes from a given node. |
|
+0
11
|
|
| 1, 0, 5, 20, 105, 520, 2605, 13020, 65105, 325520, 1627605, 8138020, 40690105, 203450520, 1017252605, 5086263020, 25431315105, 127156575520, 635782877605, 3178914388020, 15894571940105, 79472859700520
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
General form: k=5^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
FORMULA
|
G.f. = (-1 + 4*z)/(-1 + 4*z + 5*z^2)
a(n) = (5^n + 5*(-1)^n)/6
|
|
MATHEMATICA
|
k=0; lst={k}; Do[k=5^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 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
Sequence in context: A110595 A092640 A165961 this_sequence A137961 A167145 A020039
Adjacent sequences: A109497 A109498 A109499 this_sequence A109501 A109502 A109503
|
|
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
|
