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.

A322121 Composite numbers m such that b^(m-1) == 1 (mod (b^2-1)*m) has a solution b.

Table of values

n a(n)
1 25
2 49
3 65
4 85
5 91
6 121
7 125
8 133
9 145
10 169
11 185
12 205
13 217
14 221
15 247
16 259
17 265
18 289
19 301
20 305
21 325
22 341
23 343
24 361
25 365
26 377
27 403
28 425
29 427
30 445
31 451
32 469
33 481
34 485
35 493
36 505
37 511
38 529
39 533
40 545
41 553
42 559
43 565
44 589
45 625
46 629
47 637
48 671
49 679
50 685
51 689
52 697
53 703

List of values

[25, 49, 65, 85, 91, 121, 125, 133, 145, 169, 185, 205, 217, 221, 247, 259, 265, 289, 301, 305, 325, 341, 343, 361, 365, 377, 403, 425, 427, 445, 451, 469, 481, 485, 493, 505, 511, 529, 533, 545, 553, 559, 565, 589, 625, 629, 637, 671, 679, 685, 689, 697, 703]