login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100511 a(n) = Sum_{j=0..n} Sum_{k=0..n} binomial(n,j)*binomial(n,k)*max(j,k). 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; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

M. Klamkin, ed., Problems in Applied Mathematics: Selections from SIAM Review, SIAM, 1990; see pp. 127-129.

FORMULA

a(n) = n*2^(2*n-1) + (n/2)*binomial(2*n, n). [Typo corrected by Ognjen Dragoljevic, Dec 26 2017]

PROG

(PARI) a(n) = n*2^(2*n-1) + (n/2)*binomial(2*n, n); \\ Michel Marcus, Dec 26 2017

CROSSREFS

Cf. A002457, A033504.

Sequence in context: A143552 A006283 A232017 * A033506 A091639 A091636

Adjacent sequences:  A100508 A100509 A100510 * A100512 A100513 A100514

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 24 2004

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 August 14 09:14 EDT 2020. Contains 336480 sequences. (Running on oeis4.)