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.

A175940 Number of ways of writing n=p+f with p a prime and f a factorial.

Table of values

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

List of values

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