|
Search: id:A081008
|
|
|
| A081008 |
|
Fibonacci(4n+2)-1, or Fibonacci(2n)*Lucas(2n+2). |
|
+0
1
|
|
| 0, 7, 54, 376, 2583, 17710, 121392, 832039, 5702886, 39088168, 267914295, 1836311902, 12586269024, 86267571271, 591286729878, 4052739537880, 27777890035287, 190392490709134, 1304969544928656, 8944394323791463
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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)=-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 (ppl(AT)spl.at), Dec 01 2008]
|
|
MAPLE
|
with(combinat) for n from 0 to 25 do printf(`%d, `, fibonacci(4*n+2)-1) od
|
|
CROSSREFS
|
Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
Sequence in context: A092802 A062207 A116202 this_sequence A116472 A015562 A152108
Adjacent sequences: A081005 A081006 A081007 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
