cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
1 3
2 111
3 13203
4 20439
5 1997001
6 22494039
7 116226009
8 761157
9 278522253
10 206613747
11 17677747557
12 835525881
13 12933400720959
14 228717562653
15 5465090439
16 13095850041
17 431138536893
18 4734551277
19 58199580096201
20 59875330325409
21 228520359
22 3003003
23 257494085001
24 1029221499627
25 136635497220969

List of values

[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]