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.

A275850 Number of digits in range [1..A084558(n)] that do not occur in factorial base representation of n: a(n) = A084558(n) - A275806(n).

Table of values

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

List of values

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