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.

A095231 a(1)=1; a(n)=least positive integer such that the concatenation of all terms, including a(n), is == 1 (mod n).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 1
6 1
7 4
8 5
9 3
10 1
11 14
12 9
13 7
14 7
15 1
16 3
17 25
18 5
19 25
20 21
21 2
22 9
23 32
24 1
25 26
26 5
27 5
28 17
29 33
30 1
31 15
32 21
33 30
34 37
35 11
36 33
37 15
38 27
39 15
40 21
41 33
42 51
43 34
44 53
45 21
46 29
47 3
48 13
49 20
50 1
51 39
52 57
53 19
54 35
55 11
56 29
57 29
58 31
59 59
60 21
61 55
62 51
63 29
64 7
65 26
66 75
67 34
68 49
69 25
70 31
71 47
72 3
73 43
74 77
75 6
76 45
77 62
78 25

List of values

[1, 1, 2, 1, 1, 1, 4, 5, 3, 1, 14, 9, 7, 7, 1, 3, 25, 5, 25, 21, 2, 9, 32, 1, 26, 5, 5, 17, 33, 1, 15, 21, 30, 37, 11, 33, 15, 27, 15, 21, 33, 51, 34, 53, 21, 29, 3, 13, 20, 1, 39, 57, 19, 35, 11, 29, 29, 31, 59, 21, 55, 51, 29, 7, 26, 75, 34, 49, 25, 31, 47, 3, 43, 77, 6, 45, 62, 25]