|
| |
|
|
A109499
|
|
Number of closed walks of length n on the complete graph on 5 nodes from a given node.
|
|
15
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| G.f. = (-1 + 3*z)/(-1 + 3*z + 4*z^2)
a(n) = (4^n + 4*(-1)^n)/5
a(n+1) = 4*A015521(n). - Paul Curtz, Nov 01 2009
|
|
|
MATHEMATICA
| k=0; lst={k}; Do[k=4^n-k; AppendTo[lst, k], {n, 1, 5!}]; lst [From Vladimir Orlovsky, Dec 11 2008]
|
|
|
PROG
| (MAGMA) [(4^n + 4*(-1)^n)/5: n in [0..30]]; // Vincenzo Librandi, Aug 12 2011
|
|
|
CROSSREFS
| Cf. A109502.
Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521 (forms k=4^n-k) [From Vladimir Orlovsky, Dec 11 2008]
Sequence in context: A149410 A149411 A149412 * A188230 A124006 A034716
Adjacent sequences: A109496 A109497 A109498 * 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
|
| |
|
|
