Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033889 Fibonacci(4n+1). +0
22
1, 5, 34, 233, 1597, 10946, 75025, 514229, 3524578, 24157817, 165580141, 1134903170, 7778742049, 53316291173, 365435296162, 2504730781961, 17167680177565, 117669030460994, 806515533049393, 5527939700884757 (list; graph; listen)
OFFSET

0,2

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=7*a(n-1)-a(n-2). - Floor van Lamoen (fvlamoen(AT)hotmail.com), Dec 10 2001

O.g.f.: (1-2*x)/(1-7*x+x^2). a(n) = A004187(n+1)-2*A004187(n-1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 17 2008

a(n)=(1/2)*[7/2-(3/2)*sqrt(5)]^n-(1/10)*[7/2-(3/2)*sqrt(5)]^n*sqrt(5)+(1/10)*sqrt(5)*[7/2+(3/2) *sqrt(5)]^n+(1/2)*[7/2+(3/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2008

MATHEMATICA

Table[Fibonacci[4*n+1], {n, 0, 14}] (Vladimir Orlovsky, Jul 21 2008)

CROSSREFS

Sequence in context: A024063 A015545 A102436 this_sequence A120469 A066559 A073279

Adjacent sequences: A033886 A033887 A033888 this_sequence A033890 A033891 A033892

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research