|
Search: id:A115314
|
|
|
| A115314 |
|
GCD(Lucas(n)+1,Fibonacci(n)-1). |
|
+0
4
|
|
| 2, 4, 1, 2, 4, 1, 6, 4, 11, 2, 8, 1, 58, 4, 21, 2, 76, 1, 110, 4, 199, 2, 144, 1, 1042, 4, 377, 2, 1364, 1, 1974, 4, 3571, 2, 2584, 1, 18698, 4, 6765, 2, 24476, 1, 35422, 4, 64079, 2, 46368, 1, 335522, 4, 121393, 2, 439204, 1, 635622, 4, 1149851, 2, 832040, 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)=21=3*7 since F(15)-1 = 3*7*29 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, A115313.
Sequence in context: A132954 A069705 A106645 this_sequence A062039 A035492 A101229
Adjacent sequences: A115311 A115312 A115313 this_sequence A115315 A115316 A115317
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 20 2006
|
|
|
Search completed in 0.002 seconds
|
