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!)
A278934 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n,k)*binomial(2*k,k)^2. 2
1, 3, 29, 303, 3501, 42663, 538769, 6977547, 92078989, 1232902023, 16700233689, 228356672547, 3147087003201, 43659275921667, 609117615688149, 8539863624592023, 120242239301247309, 1699411957967345127, 24098616839012623769, 342754384909199620803 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
Recurrence: n^2*a(n) = (13*n^2 - 13*n + 3)*a(n-1) + 29*(n-1)^2*a(n-2) + 15*(n-2)*(n-1)*a(n-3). - Vaclav Kotesovec, Dec 02 2016
a(n) ~ 15^(n+1) / (16*Pi*n). - Vaclav Kotesovec, Dec 02 2016
MATHEMATICA
Table[Sum[(-1)^(n-k)*Binomial[n, k]*Binomial[2*k, k]^2, {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Dec 02 2016 *)
Table[(-1)^n*HypergeometricPFQ[{1/2, 1/2, -n}, {1, 1}, 16], {n, 0, 20}] (* Vaclav Kotesovec, Dec 02 2016 *)
CROSSREFS
Cf. A248586.
Cf. Sum_{k = 0..n} (-1)^(n-k)*binomial(n, k)*binomial(2*k, k)^m: A002426 (m=1), this sequence (m=2), A276537 (m=3).
Sequence in context: A112711 A155651 A268020 * A001947 A323569 A049038
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Dec 02 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 April 25 13:41 EDT 2024. Contains 371970 sequences. (Running on oeis4.)