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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014107 n*(2*n-3). 15
0, -1, 2, 9, 20, 35, 54, 77, 104, 135, 170, 209, 252, 299, 350, 405, 464, 527, 594, 665, 740, 819, 902, 989, 1080, 1175, 1274, 1377, 1484, 1595, 1710, 1829, 1952, 2079, 2210, 2345, 2484, 2627, 2774, 2925, 3080, 3239, 3402, 3569, 3740, 3915, 4094, 4277 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n) = A033537(n) - 8*n^2; A100035(a(n)) = 2 for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 31 2004

LINKS

Index entries for sequences related to linear recurrences with constant coefficients, signature (3,-3,1).

FORMULA

A014106(-n)=a(n). - Michael Somos Nov 06 2005

G.f.: x(-1+5x)/(1-x)^3. E.g.f: x(-1+2x)exp(x). - Michael Somos Nov 06 2005

a(n)=A097070(n)/A000108(n-2), n>=2 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 12 2007

a[n]:=2*a[n-1]-a[n-2]-4 seq(-a[n]), n>=0. a[0]:=0: a[1]=1 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 18 2008

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

MAPLE

a:=n->sum(j, j=2..n): seq(a(2*n), n=-1..46); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 30 2007

a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=2*a[n-1]-a[n-2]-4 od: seq(-a[n], n=0..47); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 18 2008

MATHEMATICA

a[n_]:=Sum[4*i-5, {i, 1, n}]; [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 04 2008]

PROG

(PARI) a(n)=n*(2*n-3)

CROSSREFS

Cf. A100036, A100037, A100038, A100039.

a(n)=A100345(n, n-3) for n>2.

Sequence in context: A042915 A007115 A154495 * A173102 A090398 A091941

Adjacent sequences:  A014104 A014105 A014106 * A014108 A014109 A014110

KEYWORD

sign,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 17:35 EST 2012. Contains 206061 sequences.