|
| |
|
|
A081073
|
|
Fibonacci(4n+2)+3, or Fibonacci(2n-1)*Lucas(2n+3).
|
|
0
| |
|
|
4, 11, 58, 380, 2587, 17714, 121396, 832043, 5702890, 39088172, 267914299, 1836311906, 12586269028, 86267571275, 591286729882, 4052739537884, 27777890035291, 190392490709138, 1304969544928660, 8944394323791467
(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)=3+(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 40 do printf(`%d, `, fibonacci(4*n+2)+3) od:
|
|
|
PROG
| (MAGMA) [Fibonacci(4*n+2)+3: n in [0..50]]; // Vincenzo Librandi, Apr 20 2011
|
|
|
CROSSREFS
| Cf. A000045 (Fibonacci numbers).
Sequence in context: A051770 A032181 A203577 * A002831 A114053 A134823
Adjacent sequences: A081070 A081071 A081072 * A081074 A081075 A081076
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 04, 2003
|
|
|
EXTENSIONS
| More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 05, 2003
|
| |
|
|
