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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003147 Primes with a Fibonacci primitive root.
(Formerly M3811)
4
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Primes p with a primitive root g such that g^2=g+1 mod p.

REFERENCES

D. Shanks, Fibonacci primitive roots, Fib. Quart., 10 (1972), 163-168, 181.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

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

Index entries for primes by primitive root

CROSSREFS

Subsequence of A038872.

Sequence in context: A045451 A100920 A191032 * A106068 A164566 A075322

Adjacent sequences:  A003144 A003145 A003146 * A003148 A003149 A003150

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).

Cross-reference from Charles R Greathouse IV (charles.greathouse(AT)case.edu), Nov 05 2009

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 16 03:44 EST 2012. Contains 205860 sequences.