|
Search: id:A081012
|
|
|
| A081012 |
|
Fibonacci(4n+1)-2, or Fibonacci(2n+2)*Lucas(2n-1). |
|
+0
1
|
|
| 3, 32, 231, 1595, 10944, 75023, 514227, 3524576, 24157815, 165580139, 1134903168, 7778742047, 53316291171, 365435296160, 2504730781959, 17167680177563, 117669030460992, 806515533049391, 5527939700884755, 37889062373143904
(list; graph; listen)
|
|
|
OFFSET
|
1,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+(5/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n+(11/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+1)-2) od
|
|
CROSSREFS
|
Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
Sequence in context: A004256 A002059 A028447 this_sequence A035533 A029502 A037792
Adjacent sequences: A081009 A081010 A081011 this_sequence A081013 A081014 A081015
|
|
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
|
