|
Search: id:A081070
|
|
|
| A081070 |
|
Lucas(4n)-2, or 5*Fibonacci(2n)^2. |
|
+0
2
|
|
| 0, 5, 45, 320, 2205, 15125, 103680, 710645, 4870845, 33385280, 228826125, 1568397605, 10749957120, 73681302245, 505019158605, 3461452808000, 23725150497405, 162614600673845, 1114577054219520, 7639424778862805
(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)
|
|
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) od:
|
|
CROSSREFS
|
Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
Equals 5*A049684.
Adjacent sequences: A081067 A081068 A081069 this_sequence A081071 A081072 A081073
Sequence in context: A003185 A027801 A079139 this_sequence A043025 A125836 A001260
|
|
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.002 seconds
|
