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.

A385180 Primes p == 3 (mod 4) such that (p+1) * ord(5,p) / ord(2+-i,p) is divisible by 4. Here ord(a,m) is the multiplicative order of a modulo m.

Table of values

n a(n)
1 331
2 571
3 599
4 691
5 839
6 919
7 971
8 1039
9 1051
10 1171
11 1279
12 1291
13 1319
14 1399
15 1439
16 1451
17 1571
18 1759
19 1879
20 2131
21 2411
22 2879
23 2971
24 3079
25 3251
26 3331
27 3491
28 3571
29 3691
30 3851
31 4051
32 4079
33 4091
34 4211
35 4519
36 4639
37 4651
38 4679
39 4691
40 4759
41 4919
42 4931
43 5051
44 5119
45 5171
46 5279
47 5479
48 5519
49 5531

List of values

[331, 571, 599, 691, 839, 919, 971, 1039, 1051, 1171, 1279, 1291, 1319, 1399, 1439, 1451, 1571, 1759, 1879, 2131, 2411, 2879, 2971, 3079, 3251, 3331, 3491, 3571, 3691, 3851, 4051, 4079, 4091, 4211, 4519, 4639, 4651, 4679, 4691, 4759, 4919, 4931, 5051, 5119, 5171, 5279, 5479, 5519, 5531]