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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110527 a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 0, a(1) = 1, a(2) = 8. 2
0, 1, 8, 29, 128, 537, 2280, 9653, 40896, 173233, 733832, 3108557, 13168064, 55780809, 236291304, 1000946021, 4240075392, 17961247585, 76085065736, 322301510525, 1365291107840, 5783465941881, 24499154875368 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

A048878(n) = a(n) + a(n+1). Compare with A110526.

FORMULA

G.f. -x*(1+5*x)/((1+x)*(x^2+4*x-1))

a(n)=-(1/2)*[2-sqrt(5)]^n+(-1)^n-(1/2)*[2+sqrt(5)]^n+(2/5)*[2+sqrt(5)]^n*sqrt(5)-(2/5)*[2 -sqrt(5)]^n*sqrt(5), with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Oct 02 2008]

MAPLE

seriestolist(series(-x*(1+5*x)/((1+x)*(x^2+4*x-1)), x=0, 25)); -or- Floretion Algebra Multiplication Program, FAMP Code: 1lesseq[(- 'i + 'j - i' + j' - 'kk' - 'ik' - 'jk' - 'ki' - 'kj')(+ .5'i + .5i' + .5'jj' + .5'kk')], apart from initial term.

CROSSREFS

Cf. A110526, A110528, A033887, A001076, A049661, A033887.

Sequence in context: A199207 A088131 A072264 * A189946 A105421 A071931

Adjacent sequences:  A110524 A110525 A110526 * A110528 A110529 A110530

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jul 24 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 16 16:34 EST 2012. Contains 205938 sequences.