login
A079670
a(n) = (gcd(2^p-1, Fibonacci(p))-1)/(8p) > 0 where p = n-th prime from A080050.
1
1, 10, 3, 30, 10, 1, 3, 1, 1, 1, 4, 2, 1, 1, 1, 1, 3, 7, 1, 2, 3, 1, 1, 1, 1, 3, 1, 1, 1, 5, 5, 2, 4, 1, 1, 5, 5, 12, 1, 2, 3, 1, 1, 2, 1, 2, 1, 10, 1, 5, 1, 5, 1, 10, 1, 2, 1, 1, 1, 1, 1, 1, 5, 15, 1, 2, 3, 1, 3, 1, 1, 1, 1, 1, 2, 6, 10, 1, 4, 2, 6, 2, 1, 1, 1, 1, 1, 1, 14, 6, 1, 1
OFFSET
0,2
COMMENTS
The members of the sequence seem to be all integers. Conjecture: a(n) > 1 if A080050(n) !== 1 (mod 10). The reverse is not true.
FORMULA
a(n) = (A080051(n)-1)/(8*A080050(n)).
CROSSREFS
KEYWORD
nonn
AUTHOR
Ralf Stephan, Jan 25 2003
STATUS
approved