login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268149 A double binomial sum involving absolute values. 2
0, 24, 1120, 33264, 823680, 18475600, 389398464, 7862853600, 153876579840, 2940343837200, 55138611528000, 1018383898440480, 18574619721465600, 335240928272918304, 5996573430996184960, 106438123408375281600, 1876607120325212706816, 32891715945378106711440 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A fast algorithm follows from Theorem 1 of Brent et al. article.
LINKS
Richard P. Brent, Hideyuki Ohtsuka, Judy-anne H. Osborn, Helmut Prodinger, Some binomial sums involving absolute values, arXiv:1411.1477v2 [math.CO], 2016.
FORMULA
a(n) = Sum_{k=-n..n} (Sum_{l=-n..n} binomial(2*n, n+k)*binomial(2*n, n+l)*abs(k-l)^3).
Conjecture D-finite with recurrence (2*n-1)*(n-1)*a(n) +2*(-22*n^2+27*n-36)*a(n-1) +12*(4*n-5)*(4*n-7)*a(n-2)=0. - R. J. Mathar, Feb 27 2023
PROG
(PARI) a(n) = sum(k=-n, n, sum(l=-n, n, binomial(2*n, n+k)*binomial(2*n, n+l)*abs(k-l)^3));
CROSSREFS
Sequence in context: A046906 A130552 A160260 * A114051 A269092 A010562
KEYWORD
easy,nonn
AUTHOR
Richard P. Brent, Jan 27 2016
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 00:25 EDT 2024. Contains 372298 sequences. (Running on oeis4.)