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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117917 a(n) = 3*a(n-1) + a(n-2) + n. 0
1, 4, 15, 52, 175, 582, 1927, 6370, 21045, 69514, 229597, 758316, 2504557, 8272000, 27320571, 90233728, 298021771, 984299058, 3250918963, 10737055966, 35462086881, 117123316630, 386832036793, 1277619427032, 4219690317913 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Simple recursive sequence.

a(n)/a(n-1) tends to 3.30277563... = expArcSinh(3/2).

FORMULA

O.g.f.: -(1-x+x^2)/{(-1+x)^2 (-1+3*x+x^2)} . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 17 2008

EXAMPLE

a(5) = 582 = 3*a(n-1) + a(n-2) + n; = 3*175 + 52 + 5.

MATHEMATICA

Join[{a=1, b=4}, Table[c=3*b+a+n; a=b; b=c, {n, 2, 60}]] (*From Vladimir Joseph Stephan Orlovsky, Jan 22 2011*)

CROSSREFS

Sequence in context: A137213 A027853 A132894 * A192431 A161125 A027295

Adjacent sequences:  A117914 A117915 A117916 * A117918 A117919 A117920

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 02 2006

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 17 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 15 20:03 EST 2012. Contains 205852 sequences.