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.

A077149 a(1) =3. For n>1, a(n) = smallest k such that there are n numbers m not relatively prime to n in range n < m < k.

Table of values

n a(n)
1 3
2 7
3 13
4 13
5 31
6 16
7 57
8 25
9 37
10 27
11 133
12 31
13 183
14 39
15 49
16 49
17 307
18 46
19 381
20 55
21 71
22 63
23 553
24 61
25 151
26 75
27 109
28 78
29 871
30 71
31 993
32 97
33 118
34 99
35 148
36 91
37 1407
38 111
39 142
40 107
41 1723
42 101
43 1893
44 125
45 142
46 135
47 2257
48 121
49 393
50 135
51 188
52 149
53 2863
54 136
55 256
56 155

List of values

[3, 7, 13, 13, 31, 16, 57, 25, 37, 27, 133, 31, 183, 39, 49, 49, 307, 46, 381, 55, 71, 63, 553, 61, 151, 75, 109, 78, 871, 71, 993, 97, 118, 99, 148, 91, 1407, 111, 142, 107, 1723, 101, 1893, 125, 142, 135, 2257, 121, 393, 135, 188, 149, 2863, 136, 256, 155]