|
Search: id:A045468
|
|
|
| A045468 |
|
Primes congruent to {1, 4} mod 5. |
|
+0
25
|
|
| 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
These are also primes p that divide Fibonacci(p-1) - Jud McCranie (j.mccranie(AT)comcast.net)
Primes ending in 1 or 9. - Lekraj Beedassy (blekraj(AT)yahoo.com), Oct 27 2003
Also primes p such that p divides 5^(p-1)/2 - 4^(p-1)/2. - Cino Hilliard (hillcino368(AT)gmail.com), Sep 06 2004
Primes p such that the polynomial x^2-x-1 mod p has 2 distinct zeros. - T. D. Noe (noe(AT)sspectra.com), May 02 2005
almost the same as: A038872 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 26 2009]
|
|
REFERENCES
|
Hardy and Wright, An Introduction to the Theory of Numbers, Chap.X, p. 150, Oxford University Press, Fifth edition
|
|
FORMULA
|
A038872 \ {5}. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 18 2008]
|
|
MATHEMATICA
|
lst={}; Do[p=Prime[n]; If[Mod[p, 5]==1||Mod[p, 5]==4, AppendTo[lst, p]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 26 2009]
|
|
CROSSREFS
|
Cf. A064739.
Cf. A038872 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 26 2009]
Sequence in context: A158290 A057538 A123976 this_sequence A053032 A034099 A034109
Adjacent sequences: A045465 A045466 A045467 this_sequence A045469 A045470 A045471
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
