login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=1..15.

CROSSREFS

Cf. A071126.

Sequence in context: A282675 A280141 A280142 * A266435 A216479 A123698

Adjacent sequences:  A077570 A077571 A077572 * A077574 A077575 A077576

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Nov 11 2002

EXTENSIONS

More terms from Sascha Kurz, Jan 04 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 12:09 EDT 2020. Contains 336439 sequences. (Running on oeis4.)