Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077573
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077573 Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0. +0
3
0, 111, 0, 111111, 11, 111111, 1111111111111111, 111111111111111111, 1111111111111111111111, 1111111111111111111111111111, 111111111111111, 111, 11111, 111111111111111111111, 1111111111111111111111111111111111111111111111 (list; graph; listen)
OFFSET

1,2

COMMENT

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: A143750 A028673 A138280 this_sequence A123698 A123727 A072807

Adjacent sequences: A077570 A077571 A077572 this_sequence A077574 A077575 A077576

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 11 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 04 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research