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.

A024942 Number of partitions of n into distinct primes of the form 4k + 3.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 2, 0, 0, 1, 2, 1, 0, 2, 2, 0, 0, 2, 1, 0, 1, 2, 2, 1, 1, 2, 1, 1, 0, 2, 3, 0, 2, 3, 3, 0, 1, 4, 1, 1, 2, 4, 2, 1, 3, 3, 3, 1, 3, 4, 3, 2, 2, 6, 3, 1, 4, 6, 4, 1, 6, 6, 3, 3, 5, 7, 3, 3, 6, 7, 6, 2, 7, 9, 3, 2, 7, 10, 2, 4, 11, 10, 4, 5, 12, 7]