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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153819 Linear recurrence with a(n) = 3a(n-1) - a(n-2) + 2 = 4a(n-1) - 4a(n-2) + a(n-3). Full sequence for A153466. 3
16, 34, 88, 232, 610, 1600, 4192, 10978, 28744, 75256, 197026, 515824, 1350448, 3535522, 9256120, 24232840, 63442402, 166094368, 434840704, 1138427746, 2980442536, 7802899864, 20428257058, 53481871312, 140017356880, 366570199330 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

a(n) mod 9 = 7.

A two-way infinite sequence with a(-n) = a(n-1).

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (4,-4,1).

FORMULA

G.f.: 2*(8-15*x+8*x^2)/((1-x)*(1-3*x+x^2)) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Aug 30 2009]

a(n) = 2*A153873(n).

CROSSREFS

Sequence in context: A091216 A132760 A203446 * A185459 A070589 A104910

Adjacent sequences:  A153816 A153817 A153818 * A153820 A153821 A153822

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jan 02 2009

EXTENSIONS

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 05 2009

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 16:21 EST 2012. Contains 205823 sequences.