Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053032 Odd primes p with one zero in Fibonacci numbers mod p. +0
9
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; listen)
OFFSET

1,1

COMMENT

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: A057538 A123976 A045468 this_sequence A034099 A034109 A080821

Adjacent sequences: A053029 A053030 A053031 this_sequence A053033 A053034 A053035

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research