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.

A345330 Composite numbers k for which m == 0 (mod k) is the only solution to m^(2^v(k-1)+1) == -m (mod k), where v(k) = A007814(k) is the 2-adic valuation of k.

Table of values

n a(n)
1 9
2 21
3 25
4 27
5 33
6 45
7 49
8 57
9 63
10 65
11 69
12 77
13 81
14 93
15 99
16 105
17 117
18 121
19 125
20 129
21 133
22 141
23 145
24 147
25 161
26 165
27 169
28 171
29 177
30 185
31 189
32 201
33 207
34 209
35 213
36 217
37 225
38 231
39 237
40 243
41 245
42 249
43 253
44 261
45 265
46 273
47 279
48 285
49 289
50 297
51 301
52 305
53 309
54 321
55 325

List of values

[9, 21, 25, 27, 33, 45, 49, 57, 63, 65, 69, 77, 81, 93, 99, 105, 117, 121, 125, 129, 133, 141, 145, 147, 161, 165, 169, 171, 177, 185, 189, 201, 207, 209, 213, 217, 225, 231, 237, 243, 245, 249, 253, 261, 265, 273, 279, 285, 289, 297, 301, 305, 309, 321, 325]

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

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