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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109164 a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3), n >= 3. 0
1, 6, 20, 57, 154, 408, 1073, 2814, 7372, 19305, 50546, 132336, 346465, 907062, 2374724, 6217113, 16276618, 42612744, 111561617, 292072110, 764654716, 2001892041, 5241021410, 13721172192, 35922495169, 94046313318, 246216444788 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n) - a(n-1) = A054486(n+1); G.f. (2*x+1)/((1-x)*(x^2-3*x+1))

MATHEMATICA

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

PROG

Floretion Algebra Multiplication Program, FAMP Code: 4tessumseq[ + .25'i + .25i' + .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' + .25e], sumtype: (Y[15], *, vesy)

CROSSREFS

Cf. A054486.

Sequence in context: A048611 A200528 A127982 * A027984 A018808 A027107

Adjacent sequences:  A109161 A109162 A109163 * A109165 A109166 A109167

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 18 2005

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 14 05:09 EST 2012. Contains 205570 sequences.