|
Search: id:A115311
|
|
|
| A115311 |
|
GCD(Lucas(n)-1,Fibonacci(n)-1). |
|
+0
4
|
|
| 0, 2, 1, 2, 2, 1, 4, 2, 3, 2, 22, 1, 8, 2, 29, 2, 42, 1, 76, 2, 55, 2, 398, 1, 144, 2, 521, 2, 754, 1, 1364, 2, 987, 2, 7142, 1, 2584, 2, 9349, 2, 13530, 1, 24476, 2, 17711, 2, 128158, 1, 46368, 2, 167761, 2, 242786, 1, 439204, 2, 317811, 2, 2299702, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Lucas(1)=1, Lucas(2)=3, Lucas(n>2)=Lucas(n-1)+Lucas(n-2) A000032.
|
|
EXAMPLE
|
a(15)=29 since F(15)-1 =3*7*29 and L(15)-1=29*49
|
|
MATHEMATICA
|
lucas[1]=1; lucas[2]=3; lucas[n_]:= lucas[n]= lucas[n-1] + lucas[n-2]; Table[GCD[lucas[i]-1, Fibonacci[i]-1], {i, 60}]
|
|
CROSSREFS
|
Cf. A000032, A000045, A111956, A115312, A115313, A115314.
Sequence in context: A060438 A106190 A029290 this_sequence A035436 A035369 A129719
Adjacent sequences: A115308 A115309 A115310 this_sequence A115312 A115313 A115314
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 20 2006
|
|
|
Search completed in 0.002 seconds
|
