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.

A275964 Total number of nonzero digits with multiple occurrences in factorial base representation of n (counted with multiplicity): a(n) = A275812(A275735(n)).

Table of values

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

List of values

[0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 2, 3, 3, 4, 2, 3, 0, 2, 2, 3, 2, 4, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 2, 2, 3, 2, 4, 2, 2, 2, 4, 3, 3, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 2, 4, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0]