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.

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

Table of values

n a(n)
1 11
2 79
3 131
4 199
5 211
6 239
7 251
8 331
9 359
10 439
11 479
12 491
13 571
14 599
15 691
16 719
17 811
18 839
19 919
20 971
21 1039
22 1051
23 1091
24 1171
25 1279
26 1291
27 1319
28 1399
29 1439
30 1451
31 1531
32 1559
33 1571
34 1759
35 1811
36 1879
37 1931
38 1999
39 2011
40 2039
41 2131
42 2239
43 2251
44 2371
45 2399
46 2411
47 2531
48 2719
49 2731
50 2851
51 2879
52 2971
53 2999

List of values

[11, 79, 131, 199, 211, 239, 251, 331, 359, 439, 479, 491, 571, 599, 691, 719, 811, 839, 919, 971, 1039, 1051, 1091, 1171, 1279, 1291, 1319, 1399, 1439, 1451, 1531, 1559, 1571, 1759, 1811, 1879, 1931, 1999, 2011, 2039, 2131, 2239, 2251, 2371, 2399, 2411, 2531, 2719, 2731, 2851, 2879, 2971, 2999]