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!)
A123693 Primes p such that p^2 divides 7^(p-1) - 1. 16
5, 491531 (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..2.

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

W. Keller and J. Richstein, Fermat quotients q_p(a) that are divisible by p.

CROSSREFS

Cf. A001220, A014127, A123692, A123693, A128667, A128668, A090968, A039951, A128669

Sequence in context: A240132 A067509 A067502 * A111727 A231018 A115738

Adjacent sequences:  A123690 A123691 A123692 * A123694 A123695 A123696

KEYWORD

bref,hard,nonn,more

AUTHOR

Max Alekseyev, Oct 07 2006

EXTENSIONS

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 21 06:28 EST 2014. Contains 252297 sequences.