Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033891 Fibonacci(4n+3). +0
20
2, 13, 89, 610, 4181, 28657, 196418, 1346269, 9227465, 63245986, 433494437, 2971215073, 20365011074, 139583862445, 956722026041, 6557470319842, 44945570212853, 308061521170129, 2111485077978050 (list; graph; listen)
OFFSET

0,1

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

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

G.f.: (2-x)/(1-7x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 17 2008]

MATHEMATICA

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

CROSSREFS

Sequence in context: A092849 A106938 A106937 this_sequence A126035 A074617 A140636

Adjacent sequences: A033888 A033889 A033890 this_sequence A033892 A033893 A033894

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research