login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=0..91.

FORMULA

a(n) = (A080051(n)-1)/(8*A080050(n)).

CROSSREFS

Cf. A000045, A080050, A080051.

Sequence in context: A195817 A228314 A243239 * A050100 A103219 A260680

Adjacent sequences:  A079667 A079668 A079669 * A079671 A079672 A079673

KEYWORD

nonn

AUTHOR

Ralf Stephan, Jan 25 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 09:16 EDT 2020. Contains 336274 sequences. (Running on oeis4.)