login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132757 n(n+29)/2. 1
0, 15, 31, 48, 66, 85, 105, 126, 148, 171, 195, 220, 246, 273, 301, 330, 360, 391, 423, 456, 490, 525, 561, 598, 636, 675, 715, 756, 798, 841, 885, 930, 976, 1023, 1071, 1120, 1170, 1221, 1273, 1326, 1380, 1435, 1491, 1548, 1606, 1665 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n) = n*(n+29)/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,15), for n>=1. [From Milan R. Janjic (agnus(AT)blic.net), Dec 20 2008]

a(n)=n+a(n-1)+14 with a(0)=0 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 03 2010]

EXAMPLE

a(1)=1+0+14=15; a(2)=2+15+14=31; a(3)=3+31+14=48 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 03 2010]

MATHEMATICA

i=-14; s=0; lst={}; Do[s+=n+i; If[s>=0, AppendTo[lst, s]], {n, 0, 6!, 1}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 29 2008]

CROSSREFS

Cf. A000217, A056126.

Sequence in context: A044076 A125169 A044457 * A045135 A195046 A102955

Adjacent sequences:  A132754 A132755 A132756 * A132758 A132759 A132760

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Aug 28 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.