Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A166863
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A166863 a(1)= 1; a(2)= 5; thereafter a(n)= a(n-1)+a(n-2)+5 +0
2
1, 5, 11, 21, 37, 63, 105, 173, 283, 461, 749, 1215, 1969, 3189, 5163, 8357, 13525, 21887, 35417, 57309, 92731, 150045, 242781, 392831, 635617, 1028453, 1664075, 2692533, 7049151, 11405769 (list; graph; listen)
OFFSET

1,2

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (2,0,-1)

FORMULA

a(n) = A154691(n)-2 = 2*A000045(n+3)-5. [R. J. Mathar, (mathar(AT)strw.leidenuniv.nl), Oct 26 2009]

a(n) = 2*a(n-1)-a(n-3). G.f: x*(1+3*x+x^2)/((x-1)* (x^2+x-1)). [R. J. Mathar, (mathar(AT)strw.leidenuniv.nl), Oct 26 2009]

EXAMPLE

For n = 3, a(n) = 5+1+5=11

CROSSREFS

Sequence in context: A166480 A164096 A163787 this_sequence A163704 A131898 A168642

Adjacent sequences: A166860 A166861 A166862 this_sequence A166864 A166865 A166866

KEYWORD

easy,nonn

AUTHOR

Geoffrey O. Ahiakwo (obuusoltd(AT)yahoo.com), Oct 22 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research