id:A125636 - OEIS Search Results

Search: id:A125636

Displaying 1-1 of 1 results found.

page 1

Smallest odd prime base q such that p^2 divides q^(p-1) - 1, where p = Prime[n].

+0
14

5, 17, 7, 19, 3, 19, 131, 127, 263, 41, 229, 691, 313, 19, 53, 521, 53, 601, 1301, 11, 619, 31, 269, 3187, 53, 181, 43, 317, 499, 373, 911, 659, 19, 3659, 313, 751, 233, 4373, 3307, 419, 2591, 313, 1249, 2897, 349, 709, 331, 1973, 1933, 503, 821, 977, 2371, 263 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`W. Keller and J. Richstein Fermat quotients that are divisible by p.`
	CROSSREFS	Cf. A125637 = Smallest odd prime base q such that p^3 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: A092679 A090592 A093558 this_sequence A070848 A060829 A096896` `Adjacent sequences: A125633 A125634 A125635 this_sequence A125637 A125638 A125639`
	KEYWORD	`hard,nonn`
	AUTHOR	`Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 28 2006`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research