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.

A024941 Number of partitions of n into distinct primes of the form 4k + 1.

Table of values

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

List of values

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