Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

COMMENT

a(n) mod 9 = 7.

A two-way infinite sequence with a(-n) = a(n-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]

CROSSREFS

Sequence in context: A132370 A091216 A132760 this_sequence A070589 A104910 A161441

Adjacent sequences: A153816 A153817 A153818 this_sequence 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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research