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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081011 Fibonacci(4n+3)+2, or Fibonacci(2n+3)*Lucas(2n). 0
4, 15, 91, 612, 4183, 28659, 196420, 1346271, 9227467, 63245988, 433494439, 2971215075, 20365011076, 139583862447, 956722026043, 6557470319844, 44945570212855, 308061521170131, 2111485077978052, 14472334024676223 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

REFERENCES

Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75

FORMULA

a(n) = 8a(n-1)-8a(n-2)+a(n-3)

a(n)=2+[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n+(2/5)*sqrt(5)*{[(7/2)+(3/2)*sqrt(5))^n-[(7/2)-(3/2)*sqrt(5)]^n}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Dec 01 2008]

MAPLE

with(combinat) for n from 0 to 25 do printf(`%d, `, fibonacci(4*n+3)+2) od

MATHEMATICA

Table[Fibonacci[4n + 3] + 2, {n, 0, 19}] (* or *)

Table[Fibonacci[2n + 3]LucasL[2n], {n, 0, 19}] (* From Alonso del Arte, Apr 18 2011 *)

PROG

(MAGMA) [Fibonacci(4*n+3)+2: n in [0..30]]; // Vincenzo Librandi, Apr 18 2011

CROSSREFS

Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).

Sequence in context: A034496 A079155 A076900 * A008829 A013193 A040025

Adjacent sequences:  A081008 A081009 A081010 * A081012 A081013 A081014

KEYWORD

nonn,easy

AUTHOR

R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 01, 2003

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 03, 2003

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 16 07:10 EST 2012. Contains 205874 sequences.