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.

A286604 a(n) = n mod sum of digits of n in factorial 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 1
26 0
27 0
28 1
29 1
30 0
31 1
32 2
33 1
34 2
35 0
36 0
37 1
38 2
39 4
40 0
41 5
42 2
43 3
44 4
45 3
46 4
47 5
48 0
49 1
50 2
51 3
52 0
53 3
54 0
55 3
56 0
57 2
58 3
59 5
60 0
61 1
62 2
63 3
64 4
65 2
66 1
67 1
68 2
69 6
70 0
71 7
72 0
73 1
74 2
75 0
76 1
77 5
78 2
79 4
80 0
81 3
82 4
83 6
84 4
85 1
86 2
87 3
88 4
89 1
90 0
91 0
92 1
93 5
94 6
95 5
96 0
97 2
98 3
99 3
100 4
101 3
102 2
103 1
104 2
105 0
106 1
107 3
108 0
109 4
110 5
111 7
112 0
113 5
114 2
115 3
116 4
117 0
118 1
119 9
120 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, 1, 0, 0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 4, 0, 5, 2, 3, 4, 3, 4, 5, 0, 1, 2, 3, 0, 3, 0, 3, 0, 2, 3, 5, 0, 1, 2, 3, 4, 2, 1, 1, 2, 6, 0, 7, 0, 1, 2, 0, 1, 5, 2, 4, 0, 3, 4, 6, 4, 1, 2, 3, 4, 1, 0, 0, 1, 5, 6, 5, 0, 2, 3, 3, 4, 3, 2, 1, 2, 0, 1, 3, 0, 4, 5, 7, 0, 5, 2, 3, 4, 0, 1, 9, 0]