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.

A035457 Number of partitions of n into parts of the form 4*k + 2.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 0
6 2
7 0
8 2
9 0
10 3
11 0
12 4
13 0
14 5
15 0
16 6
17 0
18 8
19 0
20 10
21 0
22 12
23 0
24 15
25 0
26 18
27 0
28 22
29 0
30 27
31 0
32 32
33 0
34 38
35 0
36 46
37 0
38 54
39 0
40 64
41 0
42 76
43 0
44 89
45 0
46 104
47 0
48 122
49 0
50 142
51 0
52 165
53 0
54 192
55 0
56 222
57 0
58 256
59 0
60 296
61 0
62 340
63 0
64 390
65 0
66 448
67 0
68 512
69 0
70 585
71 0
72 668
73 0
74 760
75 0
76 864
77 0
78 982
79 0

List of values

[1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 8, 0, 10, 0, 12, 0, 15, 0, 18, 0, 22, 0, 27, 0, 32, 0, 38, 0, 46, 0, 54, 0, 64, 0, 76, 0, 89, 0, 104, 0, 122, 0, 142, 0, 165, 0, 192, 0, 222, 0, 256, 0, 296, 0, 340, 0, 390, 0, 448, 0, 512, 0, 585, 0, 668, 0, 760, 0, 864, 0, 982, 0]