Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109501
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109501 Number of closed walks of length n on the complete graph on 7 nodes from a given node. +0
2
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

FORMULA

G.f. = (-1 + 5*z)/(-1 + 5*z + 6*z^2)

a(n) = (6^n + 6*(-1)^n)/7

CROSSREFS

Cf. A109502.

Adjacent sequences: A109498 A109499 A109500 this_sequence A109502 A109503 A109504

Sequence in context: A001473 A063888 A029571 this_sequence A005922 A057896 A054721

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research