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.

A385188 Primes p == 3 (mod 4) such that the multiplicative order of 2+-i modulo p in Gaussian integers (A385165) is not divisible by 2 or 3.

Table of values

n a(n)
1 599
2 691
3 1291
4 1451
5 2411
6 3851
7 4919
8 5051
9 5479
10 5531
11 5879
12 6599
13 7079
14 7691
15 8011
16 8039
17 11491
18 13291
19 14011
20 15091
21 15971
22 16651
23 17359
24 18731
25 19211
26 19531
27 20731
28 22651
29 23971
30 24611
31 25639
32 25679
33 26251
34 32051
35 32359
36 32531
37 32771
38 32971
39 35879
40 37039
41 37571
42 38011
43 38371

List of values

[599, 691, 1291, 1451, 2411, 3851, 4919, 5051, 5479, 5531, 5879, 6599, 7079, 7691, 8011, 8039, 11491, 13291, 14011, 15091, 15971, 16651, 17359, 18731, 19211, 19531, 20731, 22651, 23971, 24611, 25639, 25679, 26251, 32051, 32359, 32531, 32771, 32971, 35879, 37039, 37571, 38011, 38371]