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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139576 n(2n+9). 5
0, 11, 26, 45, 68, 95, 126, 161, 200, 243, 290, 341, 396, 455, 518, 585, 656, 731, 810, 893, 980, 1071, 1166, 1265, 1368, 1475, 1586, 1701, 1820, 1943, 2070, 2201, 2336, 2475, 2618, 2765, 2916, 3071, 3230, 3393, 3560, 3731, 3906 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n)=2*n^2+9*n.

a(n)=a(n-1)+4*n+7 (with a(0)=0) [From Vincenzo Librandi, Nov 24 2010]

MATHEMATICA

s=0; lst={s}; Do[s+=n++ +11; AppendTo[lst, s], {n, 0, 7!, 4}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 19 2008]

Table[Sum[(2*i + n - 1), {i, 4, n}], {n, 3, 45}] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 11 2009]

CROSSREFS

Cf. A014105, A014106, A033537, A130861, A139577, A139578, A139579, A139580, A139581.

Sequence in context: A161451 A100566 A101969 * A166137 A046806 A027521

Adjacent sequences:  A139573 A139574 A139575 * A139577 A139578 A139579

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), May 19 2008

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 16 20:10 EST 2012. Contains 205959 sequences.