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.

A121912 Numbers k such that 10^k == 10 (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 9
8 10
9 11
10 13
11 15
12 17
13 18
14 19
15 23
16 29
17 30
18 31
19 33
20 37
21 41
22 43
23 45
24 47
25 53
26 55
27 59
28 61
29 67
30 71
31 73
32 79
33 83
34 89
35 90
36 91
37 97
38 99
39 101
40 103
41 107
42 109
43 113
44 127
45 131
46 137
47 139
48 149
49 151
50 157
51 163
52 165
53 167
54 173
55 179
56 181
57 191
58 193
59 197
60 199
61 211
62 223
63 227

List of values

[1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 15, 17, 18, 19, 23, 29, 30, 31, 33, 37, 41, 43, 45, 47, 53, 55, 59, 61, 67, 71, 73, 79, 83, 89, 90, 91, 97, 99, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 165, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227]