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.

A345331 Odd numbers k > 1 such that m^(2^v(k-1)+1) == -m (mod k) has more than one solution modulo k, where v(k) = A007814(k) is the 2-adic valuation of k.

Table of values

n a(n)
1 15
2 35
3 39
4 51
5 55
6 75
7 85
8 87
9 91
10 95
11 111
12 115
13 119
14 123
15 135
16 143
17 153
18 155
19 159
20 175
21 183
22 187
23 195
24 203
25 205
26 215
27 219
28 221
29 235
30 247
31 255
32 259
33 267
34 275
35 287
36 291
37 295
38 299
39 303
40 315
41 319
42 323
43 327
44 335
45 339
46 351
47 355
48 357
49 365
50 371
51 375
52 391
53 395
54 403

List of values

[15, 35, 39, 51, 55, 75, 85, 87, 91, 95, 111, 115, 119, 123, 135, 143, 153, 155, 159, 175, 183, 187, 195, 203, 205, 215, 219, 221, 235, 247, 255, 259, 267, 275, 287, 291, 295, 299, 303, 315, 319, 323, 327, 335, 339, 351, 355, 357, 365, 371, 375, 391, 395, 403]

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

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