|
Search: id:A081079
|
|
|
| A081079 |
|
Lucas(4n+2)-3, or 5*Fibonacci(2n)*Fibonacci(2n+2). |
|
+0
1
|
|
| 0, 15, 120, 840, 5775, 39600, 271440, 1860495, 12752040, 87403800, 599074575, 4106118240, 28143753120, 192900153615, 1322157322200, 9062201101800, 62113250390415, 425730551631120, 2918000611027440, 20000273725560975
(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)=-3+(3/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n}+(1/2)*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
|
luc := proc(n) option remember: if n=0 then RETURN(2) fi: if n=1 then RETURN(1) fi: luc(n-1)+luc(n-2): end: for n from 0 to 40 do printf(`%d, `, luc(4*n+2)-3) od:
|
|
CROSSREFS
|
Cf. A000032 (Lucas numbers), A000045 (Fibonacci numbers).
Sequence in context: A126898 A010967 A022580 this_sequence A138424 A120794 A038743
Adjacent sequences: A081076 A081077 A081078 this_sequence A081080 A081081 A081082
|
|
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
|
|
|
Search completed in 0.034 seconds
|
