id:A132609 - OEIS Search Results

Search: id:A132609

Displaying 1-1 of 1 results found.

page 1

Antidiagonal sum of table A072590(n,k) = n^(k-1)*k^(n-1) for n>=1.

+0
2

1, 2, 6, 26, 147, 1026, 8532, 82394, 906485, 11194402, 153347766, 2307805402, 37851581159, 672037936898, 12841521329896, 262772642843802, 5733086299727913, 132853067341477538, 3258726189638877610 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`A072590(n,k) equals the number of spanning trees in complete bipartite graph K(n,k).`
	FORMULA	`a(n) = Sum_{k=1..n} (n-k+1)^(k-1)*k^(n-k) for n>=1.`
	PROGRAM	`(PARI) a(n)=sum(k=1, n, (n-k+1)^(k-1)*k^(n-k))`
	CROSSREFS	`Cf. A072590, A062817; A132608.` `Sequence in context: A107404 A120574 A002710 this_sequence A125224 A052844 A052859` `Adjacent sequences: A132606 A132607 A132608 this_sequence A132610 A132611 A132612`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Aug 26 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research