OFFSET
0,1
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (17,-136,680,-2380,6188,-12376,19448,-24310,24310,-19448,12376,-6188,2380,-680,136,-17,1).
FORMULA
G.f.: 165*(1+x)*(1+9*x+19*x^2+9*x^3+x^4)/(1-x)^17. - Colin Barker, Jan 28 2013
From Amiram Eldar, Sep 08 2022: (Start)
Sum_{n>=0} 1/a(n) = 1493776559/14175 - 32032*Pi^2/3.
Sum_{n>=0} (-1)^n/a(n) = 112*Pi^2 - 1740989/1575. (End)
a(n) = 165*A030648(n). - G. C. Greubel, Mar 10 2025
EXAMPLE
If n=0 then C(0+8,0)*C(0+11,8) = C(8,0)*C(11,8) = 1*165 = 165.
If n=4 then C(4+8,4)*C(4+11,8) = C(12,4)*C(15,8) = 495*6435 = 3185325.
MATHEMATICA
Table[Binomial[n+8, n]Binomial[n+11, 8], {n, 0, 30}] (* Harvey P. Dale, Apr 26 2018 *)
PROG
(Magma)
A105944:= func< n | Binomial(n+8, 8)*Binomial(n+11, 8) >;
[A105944(n): n in [0..40]]; // G. C. Greubel, Mar 10 2025
(SageMath)
def A105944(n): return binomial(n+8, 8)*binomial(n+11, 8)
print([A105944(n) for n in range(41)]) # G. C. Greubel, Mar 10 2025
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Zerinvary Lajos, Apr 27 2005
EXTENSIONS
More terms from Colin Barker, Jan 28 2013
STATUS
approved
