1,2

_Don Reble_, Table of n, a(n) for n = 1..37

A primitive root of 2 must be == 1 (mod 2); for 3, it must be == 2 (mod 3), and for 5 it must be == 2 or 3 (mod 5). The smallest such number is 17, so a(3)=17.

Cf. A001918, A060749.

Sequence in context: A096896 A056850 A237437 * A141558 A231710 A275629

Adjacent sequences: A128892 A128893 A128894 * A128896 A128897 A128898

nonn,changed

Martin Raab, Apr 20 2007

approved