|
Search: id:A003147
|
|
|
| A003147 |
|
Primes with a Fibonacci primitive root.
(Formerly M3811)
|
|
+0
3
|
|
| 5, 11, 19, 31, 41, 59, 61, 71, 79, 109, 131, 149, 179, 191, 239, 241, 251, 269, 271, 311, 359, 379, 389, 409, 419, 431, 439, 449, 479, 491, 499, 569, 571, 599, 601, 631, 641, 659, 701, 719, 739, 751, 821, 839, 929, 971, 1019, 1039, 1051, 1091, 1129, 1171, 1181, 1201, 1259, 1301
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Primes p with a primitive root g such that g^2=g+1 mod p.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
D. Shanks, Fibonacci primitive roots, Fib. Quart., 10 (1972), 163-168, 181.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..1000
Index entries for primes by primitive root
|
|
CROSSREFS
|
Adjacent sequences: A003144 A003145 A003146 this_sequence A003148 A003149 A003150
Sequence in context: A078179 A045451 A100920 this_sequence A106068 A164566 A075322
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net).
|
|
|
Search completed in 0.002 seconds
|
