|
|
A132754
|
|
a(n) = n*(n + 23)/2.
|
|
4
|
|
|
0, 12, 25, 39, 54, 70, 87, 105, 124, 144, 165, 187, 210, 234, 259, 285, 312, 340, 369, 399, 430, 462, 495, 529, 564, 600, 637, 675, 714, 754, 795, 837, 880, 924, 969, 1015, 1062, 1110, 1159, 1209, 1260, 1312, 1365, 1419, 1474, 1530
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = n*(n+23)/2.
Let f(n,i,a) = Sum_{k=0..n-i} (binomial(n,k)*Stirling1(n-k,i)*Product_{j=0..k-1} (-a-j)), then a(n) = -f(n,n-1,12), for n>=1. - Milan Janjic, Dec 20 2008
a(0)=0, a(1)=12, a(2)=25, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Jun 21 2011
Sum_{n>=1} 1/a(n) = 2*A001008(23)/(23*A002805(23)) = 444316699/1368302936.
Sum_{n>=1} (-1)^(n+1)/a(n) = 4*log(2)/23 - 3825136961/61573632120. (End)
|
|
MATHEMATICA
|
Table[n (n + 23)/2, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 12, 25}, 50] (* Harvey P. Dale, Jun 21 2011 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|