A114207 Smallest solution to 10^m == 1 (mod m) having the prime divisor A066364(n).

3, 111, 13203, 20439, 1997001, 22494039, 116226009, 761157, 278522253, 206613747, 17677747557, 835525881, 12933400720959, 228717562653, 5465090439, 13095850041, 431138536893, 4734551277, 58199580096201, 59875330325409, 228520359, 3003003, 257494085001, 1029221499627, 136635497220969

Offset

1,1

Links

Ray Chandler, Table of n, a(n) for n = 1..2060 (first 501 terms from Max Alekseyev)

Formula

a(n)=m(p), where p=A066364(n) and m(p)=lcm(p, ord_p(10), m(q)) with q going over all prime divisors of ord_p(10).

Example

a(6)=m(5477)=22494039 since it is the smallest m such that 10^m == 1 (mod m) and 5477|m.

Prog

(PARI) { m(p) = my(f, l, q); f=factorint(p)[, 1]; l=p; for(i=1, length(f), q=znorder(Mod(10, f[i])); l=lcm(l, q); l=lcm(l, m(q)) ); l }

Crossrefs

Cf. A066364.

Sequence in context: A180765 A232769 A066138 * A128684 A292336 A037116

Adjacent sequences: A114204 A114205 A114206 * A114208 A114209 A114210

Keyword

nonn

Author

Max Alekseyev, Nov 17 2005

Status

approved