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.

A262741 Composite odd numbers m such that q == -1 (mod p) for at least one pair (p, q) < m satisfying the following two conditions: p is a prime divisor of m, and if a prime divides q then it divides m. These are called absent numbers.

Table of values

n a(n)
1 15
2 33
3 45
4 51
5 63
6 65
7 69
8 75
9 87
10 91
11 95
12 99
13 105
14 123
15 135
16 141
17 145
18 147
19 153
20 159
21 165
22 175
23 177
24 189
25 195
26 207
27 213
28 221
29 225
30 231
31 245
32 249
33 255
34 261
35 267
36 273
37 285
38 287
39 295
40 297
41 303
42 315
43 321
44 325
45 339
46 345
47 357
48 363
49 369
50 375
51 385
52 393
53 395
54 399

List of values

[15, 33, 45, 51, 63, 65, 69, 75, 87, 91, 95, 99, 105, 123, 135, 141, 145, 147, 153, 159, 165, 175, 177, 189, 195, 207, 213, 221, 225, 231, 245, 249, 255, 261, 267, 273, 285, 287, 295, 297, 303, 315, 321, 325, 339, 345, 357, 363, 369, 375, 385, 393, 395, 399]