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.

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

Table of values

n a(n)
1 11
2 79
3 83
4 131
5 139
6 191
7 199
8 211
9 239
10 251
11 307
12 331
13 347
14 359
15 419
16 439
17 479
18 491
19 503
20 571
21 587
22 599
23 659
24 691
25 719
26 811
27 839
28 863
29 919
30 947
31 971
32 1019
33 1039
34 1051
35 1091
36 1103
37 1171
38 1223
39 1231
40 1279
41 1291
42 1319
43 1399
44 1439
45 1451
46 1499
47 1523
48 1531
49 1559
50 1567
51 1571
52 1619
53 1667
54 1759

List of values

[11, 79, 83, 131, 139, 191, 199, 211, 239, 251, 307, 331, 347, 359, 419, 439, 479, 491, 503, 571, 587, 599, 659, 691, 719, 811, 839, 863, 919, 947, 971, 1019, 1039, 1051, 1091, 1103, 1171, 1223, 1231, 1279, 1291, 1319, 1399, 1439, 1451, 1499, 1523, 1531, 1559, 1567, 1571, 1619, 1667, 1759]