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.

A083808 Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).

Table of values

n a(n)
1 2
2 23
3 223
4 24443
5 199999
6 666667
7 19999999
8 22222223
9 666666667
10 44444444441
11 22222222223
12 2444444444443
13 17777777777777
14 88888888888889
15 1333333333333333
16 64444444444444439
17 88888888888888889

List of values

[2, 23, 223, 24443, 199999, 666667, 19999999, 22222223, 666666667, 44444444441, 22222222223, 2444444444443, 17777777777777, 88888888888889, 1333333333333333, 64444444444444439, 88888888888888889]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.