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.

A262748 Composite odd numbers m such that q is not equal to -1 (mod p) for every pair p,q 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 present numbers.

Table of values

n a(n)
1 9
2 21
3 25
4 27
5 35
6 39
7 49
8 55
9 57
10 77
11 81
12 85
13 93
14 111
15 115
16 117
17 119
18 121
19 125
20 129
21 133
22 143
23 155
24 161
25 169
26 171
27 183
28 185
29 187
30 201
31 203
32 205
33 209
34 215
35 217
36 219
37 235
38 237
39 243
40 247
41 253
42 259
43 265
44 275
45 279
46 289
47 291
48 299
49 301
50 305
51 309
52 319
53 323
54 327
55 329
56 333

List of values

[9, 21, 25, 27, 35, 39, 49, 55, 57, 77, 81, 85, 93, 111, 115, 117, 119, 121, 125, 129, 133, 143, 155, 161, 169, 171, 183, 185, 187, 201, 203, 205, 209, 215, 217, 219, 235, 237, 243, 247, 253, 259, 265, 275, 279, 289, 291, 299, 301, 305, 309, 319, 323, 327, 329, 333]