|
|
A105939
|
|
a(n) = binomial(n+3,3)*binomial(n+6,3).
|
|
2
|
|
|
20, 140, 560, 1680, 4200, 9240, 18480, 34320, 60060, 100100, 160160, 247520, 371280, 542640, 775200, 1085280, 1492260, 2018940, 2691920, 3542000, 4604600, 5920200, 7534800, 9500400, 11875500, 14725620
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(n) is the number of ordered pairs (A,B) of size 3 subsets of {1,2,...,n+6} such that A and B are disjoint. - Geoffrey Critzer, Sep 03 2013
|
|
LINKS
|
|
|
FORMULA
|
Sum_{n>=0} 1/a(n) = 3/50.
Sum_{n>=0} (-1)^n/a(n) = 48*log(2)/5 - 661/100. (End)
|
|
EXAMPLE
|
If n=0 then C(0+3,0)*C(0+6,3) = C(3,0)*C(6,3) = 1*20 = 20.
If n=8 then C(8+3,8)*C(8+6,3) = C(11,8)*C(14,3) = 165*364 = 60060.
|
|
MATHEMATICA
|
nn=25; f[x_]:=Exp[x](x^3/3!)^2; Range[0, nn]!CoefficientList[Series[a=f''''''[x], {x, 0, nn}], x] (* Geoffrey Critzer, Sep 03 2013 *)
Table[Binomial[n+3, 3]Binomial[n+6, 3], {n, 0, 30}] (* or *) LinearRecurrence[ {7, -21, 35, -35, 21, -7, 1}, {20, 140, 560, 1680, 4200, 9240, 18480}, 30] (* Harvey P. Dale, Mar 09 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|