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.

A378982 a(n) = (A003961(n)-(1+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 0
6 2
7 2
8 0
9 4
10 0
11 0
12 16
13 2
14 3
15 0
16 0
17 0
18 35
19 2
20 20
21 9
22 2
23 4
24 74
25 0
26 0
27 13
28 42
29 0
30 32
31 4
32 0
33 0
34 2
35 0
36 133
37 2
38 1
39 0
40 98
41 0
42 68
43 2
44 3
45 11
46 4
47 4
48 280
49 17
50 6
51 1
52 5
53 4
54 254
55 18
56 176
57 0
58 2
59 0
60 146
61 4
62 1
63 21
64 0
65 1
66 50
67 2
68 9
69 6
70 86
71 0
72 479
73 4
74 8
75 25
76 11
77 2
78 86
79 2
80 380
81 40
82 2
83 4
84 270
85 24
86 8
87 15
88 170
89 6
90 290
91 4
92 15

List of values

[0, 0, 0, 0, 0, 2, 2, 0, 4, 0, 0, 16, 2, 3, 0, 0, 0, 35, 2, 20, 9, 2, 4, 74, 0, 0, 13, 42, 0, 32, 4, 0, 0, 2, 0, 133, 2, 1, 0, 98, 0, 68, 2, 3, 11, 4, 4, 280, 17, 6, 1, 5, 4, 254, 18, 176, 0, 2, 0, 146, 4, 1, 21, 0, 1, 50, 2, 9, 6, 86, 0, 479, 4, 8, 25, 11, 2, 86, 2, 380, 40, 2, 4, 270, 24, 8, 15, 170, 6, 290, 4, 15]