id:A109502 - OEIS Search Results

Search: id:A109502

Displaying 1-1 of 1 results found.

page 1

Array read by antidiagonals: a(n,m) = number of closed walks of length n on the complete graph on m nodes.

+0
4

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; graph; listen)

	OFFSET	`0,13`
	COMMENT	`Starting index is (m,n) = (0,1)`
	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: A065293 A164615 A054876 this_sequence A112983 A158785 A112609` `Adjacent sequences: A109499 A109500 A109501 this_sequence A109503 A109504 A109505`
	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

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research