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.

A181676 Number of ways of writing n = m + f! with m a semiprime and f > 0.

Table of values

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

List of values

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