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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045468 Primes congruent to {1, 4} mod 5. 29
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

These are also primes p that divide Fibonacci(p-1) - Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu)

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]

Appears to be the primes p such that p^6 mod 210 = 1. [From Gary Detlefs, Dec 29 2011]

Primes in A047209, also in A090771. [Reinhard Zumkeller, Jan 07 2012]

REFERENCES

Hardy and Wright, An Introduction to the Theory of Numbers, Chap.X, p. 150, Oxford University Press, Fifth edition

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

A038872 \ {5}. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 18 2008]

MAPLE

for n from 1 to 500 do if(isprime(n)) and (n^6 mod 210=1) then print(n) fi od. [From Gary Detlefs, Dec 29 2011]

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]

PROG

(PARI) list(lim)=select(n->n%5==1||n%5==4, primes(primepi(lim))) \\ Charles R Greathouse IV, Jul 25 2011

(Haskell)

a045468 n = a045468_list !! (n-1)

a045468_list = [x | x <- a047209_list, a010051 x == 1]

-- Reinhard Zumkeller, Jan 07 2012

CROSSREFS

Cf. A064739.

Cf. A038872 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 26 2009]

Cf. A010051.

Sequence in context: A158290 A057538 A123976 * A196095 A053032 A034099

Adjacent sequences:  A045465 A045466 A045467 * A045469 A045470 A045471

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 14 20:38 EST 2012. Contains 205663 sequences.