|
Search: id:A115312
|
|
|
| A115312 |
|
GCD(Lucas(n)-1,Fibonacci(n)+1). |
|
+0
4
|
|
| 2, 2, 3, 2, 2, 1, 14, 2, 5, 2, 18, 1, 26, 2, 47, 2, 34, 1, 246, 2, 89, 2, 322, 1, 466, 2, 843, 2, 610, 1, 4414, 2, 1597, 2, 5778, 1, 8362, 2, 15127, 2, 10946, 1, 79206, 2, 28657, 2, 103682, 1, 150050, 2, 271443, 2, 196418, 1, 1421294, 2, 514229, 2, 1860498, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Lucas(1)=1, Lucas(2)=3, Lucas(n>2)=Lucas(n-1)+Lucas(n-2) A000032.
|
|
EXAMPLE
|
a(15)=47 since F(15)+1 =13*47 and L(15)-1=29*47
|
|
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, A115311, A115313, A115314.
Sequence in context: A104897 A097510 A138774 this_sequence A031284 A064569 A145989
Adjacent sequences: A115309 A115310 A115311 this_sequence A115313 A115314 A115315
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 20 2006
|
|
|
Search completed in 0.002 seconds
|
