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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081008 Fibonacci(4n+2)-1, or Fibonacci(2n)*Lucas(2n+2). 1
0, 7, 54, 376, 2583, 17710, 121392, 832039, 5702886, 39088168, 267914295, 1836311902, 12586269024, 86267571271, 591286729878, 4052739537880, 27777890035287, 190392490709134, 1304969544928656, 8944394323791463, 61305790721611590, 420196140727489672 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

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

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 0..500

FORMULA

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

a(n)=-1+(1/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n}+(3/10)*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+2)-1) od

PROG

(MAGMA) [Fibonacci(4*n+2)-1: n in [0..100]]; // Vincenzo Librandi, Apr 15 2011

CROSSREFS

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

Sequence in context: A116202 A203289 A204258 * A116472 A015562 A152108

Adjacent sequences:  A081005 A081006 A081007 * A081009 A081010 A081011

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 01:56 EST 2012. Contains 205860 sequences.