Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125637 Smallest odd prime base q such that p^3 divides q^(p-1) - 1, where p = Prime[n]. +0
14
17, 53, 193, 19, 2663, 239, 653, 2819, 13931, 10133, 6287, 691, 10399, 3623, 6397, 9283, 63463, 38447, 36809, 21499, 75227, 1523, 55933, 42937, 341293, 4943, 255007, 5573, 56633, 262079, 94961, 33289, 65543, 298157, 218579, 25667, 411589, 253987 (list; graph; listen)
OFFSET

1,1

LINKS

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

CROSSREFS

Cf. A125636 = Smallest odd prime base q such that p^2 divides q^(p-1) - 1, where p = Prime[n]. Cf. A125609 = Smallest prime p such that 3^n divides p^2 - 1. Cf. A125610 = Smallest prime p such that 5^n divides p^4 - 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.

Sequence in context: A033213 A082078 A107175 this_sequence A147255 A146737 A146839

Adjacent sequences: A125634 A125635 A125636 this_sequence A125638 A125639 A125640

KEYWORD

nonn

AUTHOR

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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research