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.

A385169 Primes p == 3 (mod 4) such that the multiplicative order of 2+-i modulo p in Gaussian integers (A385165) is odd.

Table of values

n a(n)
1 331
2 571
3 599
4 691
5 839
6 971
7 1051
8 1171
9 1291
10 1451
11 1571
12 1879
13 2131
14 2411
15 2971
16 3251
17 3331
18 3491
19 3571
20 3691
21 3851
22 4051
23 4091
24 4211
25 4651
26 4679
27 4691
28 4919
29 4931
30 5051
31 5171
32 5479
33 5531
34 5651
35 5839
36 5851
37 5879
38 6011
39 6599
40 6679
41 6691
42 7079
43 7211
44 7331
45 7691
46 8011
47 8039
48 8171
49 8731
50 8839
51 9011
52 9371
53 9811

List of values

[331, 571, 599, 691, 839, 971, 1051, 1171, 1291, 1451, 1571, 1879, 2131, 2411, 2971, 3251, 3331, 3491, 3571, 3691, 3851, 4051, 4091, 4211, 4651, 4679, 4691, 4919, 4931, 5051, 5171, 5479, 5531, 5651, 5839, 5851, 5879, 6011, 6599, 6679, 6691, 7079, 7211, 7331, 7691, 8011, 8039, 8171, 8731, 8839, 9011, 9371, 9811]