|
Search: id:A109499
|
|
|
| A109499 |
|
Number of closed walks of length n on the complete graph on 5 nodes from a given node. |
|
+0
14
|
|
| 1, 0, 4, 12, 52, 204, 820, 3276, 13108, 52428, 209716, 838860, 3355444, 13421772, 53687092, 214748364, 858993460, 3435973836, 13743895348, 54975581388, 219902325556, 879609302220, 3518437208884, 14073748835532
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
General form: k=4^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
FORMULA
|
G.f. = (-1 + 3*z)/(-1 + 3*z + 4*z^2)
a(n) = (4^n + 4*(-1)^n)/5
|
|
MATHEMATICA
|
k=0; lst={k}; Do[k=4^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 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
Sequence in context: A149410 A149411 A149412 this_sequence A124006 A034716 A129841
Adjacent sequences: A109496 A109497 A109498 this_sequence A109500 A109501 A109502
|
|
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
|
