Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125610
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125610 Smallest prime p such that 5^n divides p^4 - 1. +0
22
2, 7, 193, 443, 14557, 14557, 735443, 3124999, 7812499, 78124999, 292968749, 853235443, 2441406251, 53834264557, 122070312499, 202513391693, 1118040735443, 3459595983307, 3459595983307, 270488404577057 (list; graph; listen)
OFFSET

1,1

LINKS

W. Keller and J. Richstein Fermat quotients that are divisible by p.

PROGRAM

(PARI) See A125609 - Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 11 2007

CROSSREFS

Cf. A125609 = Smallest prime p such that 3^n divides p^2 - 1. Cf. A125611 = Smallest prime p such that 7^n divides p^6 - 1. Cf. A125612 = Smallest prime p such that 11^n divides p^10 - 1. Cf. A125632 = Smallest prime p such that 13^n divides p^12 - 1. Cf. A125633 = Smallest prime p such that 17^n divides p^16 - 1. Cf. A125634 = Smallest prime p such that 19^n divides p^18 - 1. Cf. A125635 = Smallest prime p such that 257^n divides p^256 - 1.

Sequence in context: A120381 A042359 A015174 this_sequence A096463 A048560 A020459

Adjacent sequences: A125607 A125608 A125609 this_sequence A125611 A125612 A125613

KEYWORD

hard,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 28 2006

EXTENSIONS

More terms from Ryan Propper (rpropper(AT)stanford.edu), Jan 02 2007

More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 11 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research