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.

A352858 a(n) = abs(E_{p-3} (mod p)) for p = prime(n), where E_i is the i-th Euler number (A000364).

Table of values

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

List of values

[1, 2, 1, 3, 8, 7, 1, 3, 9, 4, 4, 4, 14, 7, 12, 16, 25, 22, 25, 4, 23, 33, 42, 15, 46, 18, 23, 38, 58, 2, 6, 55, 0, 37, 74, 63, 10, 61, 21, 38, 92, 89, 70, 79, 69, 59, 85, 22, 27, 69, 0, 45, 58, 96, 106, 6, 50, 28, 91, 133, 46, 147, 133, 38, 29, 128, 167, 116]