|
Search: id:A132758
|
|
| |
|
| 0, 16, 33, 51, 70, 90, 111, 133, 156, 180, 205, 231, 258, 286, 315, 345, 376, 408, 441, 475, 510, 546, 583, 621, 660, 700, 741, 783, 826, 870, 915, 961, 1008, 1056, 1105, 1155, 1206, 1258, 1311, 1365, 1420, 1476, 1533, 1591, 1650
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(n) = n*(n+31)/2.
If we define f(n,i,a)=sum(binomial(n,k)*stirling1(n-k,i)*product(-a-j,j=0..k-1),k=0..n-i), then a(n) = -f(n,n-1,16), for n>=1. [From Milan R. Janjic (agnus(AT)blic.net), Dec 20 2008]
a(n)=n+a(n-1)+14 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 19 2009]
|
|
EXAMPLE
|
For n=2, a(2)=2+0+14=16; n=3, a(3)=3+16+14=33; n=4, a(4)=4+33+14=51 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 19 2009]
|
|
MATHEMATICA
|
i=-15; s=0; lst={}; Do[s+=n+i; If[s>=0, AppendTo[lst, s]], {n, 0, 5!, 1}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 29 2008]
|
|
CROSSREFS
|
Cf. A000217, A056126.
Sequence in context: A095784 A041502 A041500 this_sequence A041504 A041506 A041508
Adjacent sequences: A132755 A132756 A132757 this_sequence A132759 A132760 A132761
|
|
KEYWORD
|
easy,nonn,new
|
|
AUTHOR
|
Omar E. Pol (info(AT)polprimos.com), Aug 28 2007
|
|
|
Search completed in 0.002 seconds
|
