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.

A080064 Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).

Table of values

n a(n)
1 1
2 4
3 9
4 10
5 16
6 21
7 22
8 25
9 28
10 33
11 34
12 40
13 45
14 46
15 49
16 52
17 55
18 57
19 58
20 64
21 69
22 70
23 76
24 81
25 82
26 85
27 88
28 93
29 94
30 100
31 105
32 106
33 112
34 115
35 117
36 118
37 121
38 124
39 129
40 130
41 136
42 141
43 142
44 145
45 148
46 153
47 154
48 160
49 161
50 165
51 166
52 169
53 172
54 175
55 177
56 178
57 184
58 189
59 190
60 196

List of values

[1, 4, 9, 10, 16, 21, 22, 25, 28, 33, 34, 40, 45, 46, 49, 52, 55, 57, 58, 64, 69, 70, 76, 81, 82, 85, 88, 93, 94, 100, 105, 106, 112, 115, 117, 118, 121, 124, 129, 130, 136, 141, 142, 145, 148, 153, 154, 160, 161, 165, 166, 169, 172, 175, 177, 178, 184, 189, 190, 196]