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.

A330397 Composite numbers k such that gpf(k)^2 + gpf(k) == 0 (mod k), where gpf(k) = A006530(k) is the greatest prime dividing k.

Table of values

n a(n)
1 6
2 10
3 12
4 14
5 15
6 22
7 26
8 28
9 30
10 33
11 34
12 38
13 44
14 46
15 51
16 56
17 58
18 62
19 66
20 69
21 74
22 76
23 82
24 86
25 87
26 91
27 92
28 94
29 95
30 102
31 106
32 118
33 122
34 123
35 124
36 132
37 134
38 138
39 141
40 142
41 145
42 146
43 153
44 158
45 159
46 166
47 172
48 174
49 177
50 178
51 182
52 184
53 188
54 190
55 194
56 202
57 206
58 213
59 214
60 218
61 226
62 236

List of values

[6, 10, 12, 14, 15, 22, 26, 28, 30, 33, 34, 38, 44, 46, 51, 56, 58, 62, 66, 69, 74, 76, 82, 86, 87, 91, 92, 94, 95, 102, 106, 118, 122, 123, 124, 132, 134, 138, 141, 142, 145, 146, 153, 158, 159, 166, 172, 174, 177, 178, 182, 184, 188, 190, 194, 202, 206, 213, 214, 218, 226, 236]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.