|
Search: id:A115313
|
|
|
| A115313 |
|
GCD(Lucas(n)+1,Fibonacci(n)+1). |
|
+0
4
|
|
| 2, 2, 1, 4, 6, 1, 2, 2, 7, 4, 10, 1, 18, 2, 13, 4, 94, 1, 34, 2, 123, 4, 178, 1, 322, 2, 233, 4, 1686, 1, 610, 2, 2207, 4, 3194, 1, 5778, 2, 4181, 4, 30254, 1, 10946, 2, 39603, 4, 57314, 1, 103682, 2, 75025, 4, 542886, 1, 196418, 2, 710647, 4, 1028458, 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)=13 since F(15)+1 = 13*47 and L(15)+1 = 3*5*7*13.
|
|
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, A115312, A115314.
Adjacent sequences: A115310 A115311 A115312 this_sequence A115314 A115315 A115316
Sequence in context: A063415 A098977 A113547 this_sequence A048942 A121484 A080928
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 20 2006
|
|
|
Search completed in 0.002 seconds
|
