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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123692 Primes p such that p^2 divides 5^(p-1) - 1. 17
2, 20771, 40487, 53471161, 1645333507, 6692367337, 188748146801 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Dorais and Klyve proved that there are no further terms up to 9.7*10^14.

LINKS

Table of n, a(n) for n=1..7.

Chris K. Caldwell, The Prime Glossary, Fermat quotient.

Fran├žois G. Dorais and Dominic Klyve, A Wieferich prime search up to p < 6.7*10^15, J. Integer Seq. 14 (2011), Art. 11.9.2, 1-14.

MATHEMATICA

Select[Prime[Range[2500]], Divisible[5^(# - 1) - 1, #^2] &] (* Alonso del Arte, Aug 01 2014 *)

PROG

(PARI)

N=10^9; default(primelimit, N);

forprime(n=2, N, if(Mod(5, n^2)^(n-1)==1, print1(n, ", ")));

\\ Joerg Arndt, May 01 2013

CROSSREFS

Cf. A001220, A014127, A123693, A128667, A128668, A090968, A128669, A096082.

Sequence in context: A173156 A214598 A242959 * A132942 A237521 A131558

Adjacent sequences:  A123689 A123690 A123691 * A123693 A123694 A123695

KEYWORD

hard,nonn,more

AUTHOR

Max Alekseyev, Oct 07 2006

EXTENSIONS

More terms from Alexander Adamchuk, Nov 27 2006

Updated by Max Alekseyev, Jan 29 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 20 20:08 EST 2014. Contains 252289 sequences.