Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014107 n*(2*n-3). +0
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; listen)
OFFSET

0,3

COMMENT

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

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

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

PROGRAM

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

CROSSREFS

Cf. A100036, A100037, A100038, A100039.

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

Adjacent sequences: A014104 A014105 A014106 this_sequence A014108 A014109 A014110

Sequence in context: A047883 A042915 A007115 this_sequence A090398 A091941 A093835

KEYWORD

sign

AUTHOR

njas

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research