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.

A378981 a(n) = (A003961(n)-sigma(n)) mod (A003961(n)-2*n), where A003961 is fully multiplicative with a(prime(i)) = prime(i+1).

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 0
8 1
9 5
10 0
11 1
12 17
13 3
14 4
15 1
16 1
17 1
18 36
19 3
20 21
21 10
22 3
23 5
24 75
25 0
26 0
27 14
28 0
29 1
30 33
31 5
32 1
33 0
34 3
35 1
36 134
37 3
38 2
39 1
40 99
41 1
42 69
43 3
44 4
45 12
46 0
47 5
48 281
49 18
50 7
51 2
52 6
53 5
54 255
55 0
56 177
57 0
58 3
59 1
60 147
61 5
62 2
63 22
64 1
65 2
66 51
67 3
68 10
69 0
70 87
71 1
72 480
73 5
74 9
75 26
76 12
77 3
78 87
79 3
80 381
81 41
82 3
83 5
84 271
85 25
86 9
87 16
88 171
89 7
90 291
91 0
92 16
93 0
94 15
95 12

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 5, 0, 1, 17, 3, 4, 1, 1, 1, 36, 3, 21, 10, 3, 5, 75, 0, 0, 14, 0, 1, 33, 5, 1, 0, 3, 1, 134, 3, 2, 1, 99, 1, 69, 3, 4, 12, 0, 5, 281, 18, 7, 2, 6, 5, 255, 0, 177, 0, 3, 1, 147, 5, 2, 22, 1, 2, 51, 3, 10, 0, 87, 1, 480, 5, 9, 26, 12, 3, 87, 3, 381, 41, 3, 5, 271, 25, 9, 16, 171, 7, 291, 0, 16, 0, 15, 12]