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.

A373832 a(n) = n mod A276150(n), where A276150 is the digit sum in the primorial base.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 0, 2, 0, 3, 0, 1, 2, 5, 0, 0, 1, 3, 4, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 0, 1, 0, 3, 0, 0, 1, 5, 0, 4, 0, 3, 4, 4, 4, 1, 2, 1, 2, 3, 0, 1, 2, 3, 0, 0, 0, 3, 0, 4, 0, 5, 0, 3, 4, 3, 4, 0, 3, 1, 2, 4, 5, 3, 0, 1, 2, 7, 0, 8, 0, 3, 0, 3, 4, 5, 0, 2, 3, 3, 4, 3, 2, 1, 2, 0]