Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132755
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132755 n(n+25)/2. +0
1
0, 13, 27, 42, 58, 75, 93, 112, 132, 153, 175, 198, 222, 247, 273, 300, 328, 357, 387, 418, 450, 483, 517, 552, 588, 625, 663, 702, 742, 783, 825, 868, 912, 957, 1003, 1050, 1098, 1147, 1197, 1248, 1300, 1353, 1407, 1462, 1518, 1575 (list; graph; listen)
OFFSET

0,2

FORMULA

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

a(n)=n+a(n-1)+11 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 19 2009]

EXAMPLE

For n=2, a(2)=2+0+11=13; n=3, a(3)=3+13+11=27; n=4, a(4)=4+27+11=42 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 19 2009]

MAPLE

a:=n->sum(denom (k/(k+3)), k=10..n): seq(a(n), n=9..56); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 31 2008

MATHEMATICA

i=-12; 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: A041765 A041328 A136773 this_sequence A147450 A098266 A041332

Adjacent sequences: A132752 A132753 A132754 this_sequence A132756 A132757 A132758

KEYWORD

easy,nonn,new

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research