login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109502 Array read by antidiagonals: a(n,m) = number of closed walks of length n on the complete graph on m nodes. 3
1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 3, 2, 1, 0, 1, 0, 4, 6, 6, 0, 0, 1, 0, 5, 12, 21, 10, 1, 0, 1, 0, 6, 20, 52, 60, 22, 0, 0, 1, 0, 7, 30, 105, 204, 183, 42, 1, 0, 1, 0, 8, 42, 186, 520, 820, 546, 86, 0, 0, 1, 0, 9, 56, 301, 1110, 2605, 3276, 1641, 170, 1, 0, 1, 0, 10, 72, 456 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,13

COMMENTS

Starting index is (m,n) = (0,1)

LINKS

Table of n, a(n) for n=0..82.

FORMULA

a(m,n) = ((m-1)^n + (m-1)(-1)^n)/m

G.f.: a(m, n) = [z^n](1 - (m-2)z)/(1 - (m-2)z - (m-1)z^2)

CROSSREFS

Rows are A078008, A054878, A109499, A109500, A109501.

Sequence in context: A171912 A306605 A054876 * A323887 A323365 A323911

Adjacent sequences:  A109499 A109500 A109501 * A109503 A109504 A109505

KEYWORD

nonn,easy,tabl

AUTHOR

Mitch Harris, Jun 30 2005

EXTENSIONS

Corrected by Franklin T. Adams-Watters, Sep 18 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 22:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)