login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053032 Odd primes p with one zero in Fibonacci numbers mod p. 10
11, 19, 29, 31, 59, 71, 79, 101, 131, 139, 151, 179, 181, 191, 199, 211, 229, 239, 251, 271, 311, 331, 349, 359, 379, 419, 431, 439, 461, 479, 491, 499, 509, 521, 541, 571, 599, 619, 631, 659, 691, 709, 719, 739, 751, 809, 811, 839, 859, 911, 919, 941, 971 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Also, odd primes that divide Lucas numbers of odd index. - T. D. Noe (noe(AT)sspectra.com), Jul 25 2003

REFERENCES

C. Ballot and M. Elia, Rank and period of primes in the Fibonacci sequence; a trichotomy, Fib. Quart., 45 (No. 1, 2007), 56-63 (The sequence B1).

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

M. Renault, Fibonacci sequence modulo m

FORMULA

A prime p = prime(i) is in this sequence if p > 2 and A001602(i)/2 is odd. - T. D. Noe (noe(AT)sspectra.com), Jul 25 2003

CROSSREFS

Cf. A001176. See A112860 for another version.

Cf. A000204 (Lucas numbers), A001602 (index of the smallest Fibonacci number divisible by prime(n)), A053029 (primes dividing no Lucas number), A053027 (primes dividing Lucas numbers of even index).

Sequence in context: A123976 A045468 A196095 * A034099 A034109 A155070

Adjacent sequences:  A053029 A053030 A053031 * A053033 A053034 A053035

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Feb 23 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:15 EST 2012. Contains 206061 sequences.