|
Search: id:A081014
|
|
|
| A081014 |
|
Lucas(4n+1)+1, or Lucas(2n)*Lucas(2n+1). |
|
+0
1
|
|
| 2, 12, 77, 522, 3572, 24477, 167762, 1149852, 7881197, 54018522, 370248452, 2537720637, 17393796002, 119218851372, 817138163597, 5600748293802, 38388099893012, 263115950957277, 1803423556807922, 12360848946698172
(list; graph; listen)
|
|
|
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)=1+(1/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 25 do printf(`%d, `, luc(4*n+1)+1) od:
|
|
CROSSREFS
|
Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
Sequence in context: A037725 A037620 A121680 this_sequence A062871 A107632 A082142
Adjacent sequences: A081011 A081012 A081013 this_sequence A081015 A081016 A081017
|
|
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
|
