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.

A258367 a(n) is the smallest A (in absolute value) such that for p = prime(n), 2^{(p-1)/2} == +-1 + A*p (mod p^2), i.e., such that p is a near-Wieferich prime.

Table of values

n a(n)
2 1
3 1
4 1
5 3
6 5
7 2
8 8
9 3
10 14
11 3
12 18
13 9
14 9
15 22
16 18
17 4
18 18
19 5
20 1
21 28
22 30
23 24
24 3
25 20
26 46
27 22
28 47
29 21
30 15
31 9
32 57
33 42
34 15
35 48
36 28
37 41
38 48
39 60
40 85
41 25
42 74
43 25
44 52
45 11
46 32
47 51
48 17
49 13
50 34
51 113
52 13
53 71
54 2
55 16
56 64
57 130
58 81
59 35
60 37
61 29
62 39
63 147
64 68
65 60
66 71
67 96
68 92
69 99
70 12

List of values

[1, 1, 1, 3, 5, 2, 8, 3, 14, 3, 18, 9, 9, 22, 18, 4, 18, 5, 1, 28, 30, 24, 3, 20, 46, 22, 47, 21, 15, 9, 57, 42, 15, 48, 28, 41, 48, 60, 85, 25, 74, 25, 52, 11, 32, 51, 17, 13, 34, 113, 13, 71, 2, 16, 64, 130, 81, 35, 37, 29, 39, 147, 68, 60, 71, 96, 92, 99, 12]