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.

A268923 All odd primes a(n) such that for all odd primes q smaller than a(n) the order of 2 modulo a(n)*q is a proper divisor of phi(a(n)*q)/2. The totient function phi is given in A000010.

Table of values

n a(n)
1 17
2 31
3 41
4 43
5 73
6 89
7 97
8 109
9 113
10 127
11 137
12 151
13 157
14 193
15 223
16 229
17 233
18 241
19 251
20 257
21 277
22 281
23 283
24 307
25 313
26 331
27 337
28 353
29 397
30 401
31 409
32 431
33 433
34 439
35 449
36 457
37 499
38 521
39 569
40 571
41 577
42 593
43 601
44 617
45 631
46 641
47 643
48 673
49 683
50 691
51 727
52 733
53 739
54 761
55 769
56 809
57 811
58 857
59 881
60 911
61 919

List of values

[17, 31, 41, 43, 73, 89, 97, 109, 113, 127, 137, 151, 157, 193, 223, 229, 233, 241, 251, 257, 277, 281, 283, 307, 313, 331, 337, 353, 397, 401, 409, 431, 433, 439, 449, 457, 499, 521, 569, 571, 577, 593, 601, 617, 631, 641, 643, 673, 683, 691, 727, 733, 739, 761, 769, 809, 811, 857, 881, 911, 919]