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.

A140274 a(1)=1; a(n)=least nonnegative 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 0
18 3
19 19
20 21
21 2
22 5
23 7
24 21
25 26
26 7
27 36
28 33
29 19
30 11
31 35
32 37
33 30
34 33
35 21
36 33
37 7
38 5
39 24
40 1
41 9
42 23
43 52
44 17
45 6
46 17
47 29
48 29
49 56
50 51
51 22
52 17
53 55
54 3
55 26
56 33
57 10
58 19
59 53
60 21
61 17
62 3
63 43
64 37
65 26
66 57
67 28
68 9
69 14
70 31
71 22
72 73
73 65
74 59
75 26
76 69
77 80
78 19
79 17

List of values

[1, 1, 2, 1, 1, 1, 4, 5, 3, 1, 14, 9, 7, 7, 1, 3, 0, 3, 19, 21, 2, 5, 7, 21, 26, 7, 36, 33, 19, 11, 35, 37, 30, 33, 21, 33, 7, 5, 24, 1, 9, 23, 52, 17, 6, 17, 29, 29, 56, 51, 22, 17, 55, 3, 26, 33, 10, 19, 53, 21, 17, 3, 43, 37, 26, 57, 28, 9, 14, 31, 22, 73, 65, 59, 26, 69, 80, 19, 17]