id:A100511 - OEIS Search Results

Search: id:A100511

Displaying 1-1 of 1 results found.

page 1

Sum_{j=0..n} Sum_{k=0..n} binomial(n,j)*binomial(n,k)*max(j,k).

+0
2

0, 3, 22, 126, 652, 3190, 15060, 69356, 313624, 1398438, 6166660, 26948548, 116888232, 503811516, 2159864392, 9216445080, 39168381488, 165864540934, 700151508324, 2947120122068, 12373581565960, 51831196048212, 216659135089496, 903925011410536 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`M. Klamkin, ed., Problems in Applied Mathematics: Selections from SIAM Review, SIAM, 1990; see pp. 127-129.`
	FORMULA	`Equals n2^(n-1) + (n/2)binomial(2*n, n).`
	CROSSREFS	`Cf. A002457, A033504.` `Sequence in context: A061182 A143552 A006283 this_sequence A033506 A091639 A091636` `Adjacent sequences: A100508 A100509 A100510 this_sequence A100512 A100513 A100514`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 24 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research