A077573 Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0.

0, 111, 0, 111111, 11, 111111, 1111111111111111, 111111111111111111, 1111111111111111111111, 1111111111111111111111111111, 111111111111111, 111, 11111, 111111111111111111111, 1111111111111111111111111111111111111111111111

Offset: 1

Author

Amarnath Murthy, Nov 11 2002

Keywords

• nonn

Comments

For every prime p > 5, {10^(p-1) -1}/9 == 0 (mod p), by Fermat's Little theorem.

References

• Amarnath Murthy, On the divisors of Smarandache Unary Sequence. Smarandache Notions Journal, Vol. 11, 2000.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..170

Crossrefs

Cf. A071126.

Extensions

More terms from Sascha Kurz, Jan 04 2003