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.

A276004 a(n) is the number of nonzero digits in the factorial-base representation of n that are matched by more significant digits from left; a(n) = A060502(n) - A060128(n).

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 2, 3, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 2, 1, 1, 0, 1, 1, 2, 1, 2, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 2, 1, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0]