Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003060 Smallest number with reciprocal of period n.
(Formerly M2886)
+0
1
1, 3, 11, 27, 101, 41, 7, 239, 73, 81, 451, 21649, 707, 53, 2629, 31, 17, 2071723, 19, 1111111111111111111, 3541, 43, 23, 11111111111111111111111, 511, 21401, 583, 243, 29, 3191, 211 (list; graph; listen)
OFFSET

0,2

COMMENT

For n>0, a(n) is the least divisor d>1 of 10^n-1 such that the multiplicative order of 10 mod d is n. For prime n, a(n)=A007138(n). - T. D. Noe, Aug 07 2007

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

"Cycle lengths of reciprocals", Popular Computing (Calabasas, CA), Vol. 1 (No. 4, Jul 1973), pp. 12-14.

J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

Index entries for sequences related to decimal expansion of 1/n

CROSSREFS

Sequence in context: A077776 A113836 A036571 this_sequence A136983 A119074 A163696

Adjacent sequences: A003057 A003058 A003059 this_sequence A003061 A003062 A003063

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research