login
A077573
Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0.
3
0, 111, 0, 111111, 11, 111111, 1111111111111111, 111111111111111111, 1111111111111111111111, 1111111111111111111111111111, 111111111111111, 111, 11111, 111111111111111111111, 1111111111111111111111111111111111111111111111
OFFSET
1,2
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.
CROSSREFS
Cf. A071126.
Sequence in context: A282675 A280141 A280142 * A266435 A216479 A123698
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Nov 11 2002
EXTENSIONS
More terms from Sascha Kurz, Jan 04 2003
STATUS
approved