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.

A035455 Number of partitions of n into parts 8k+2 or 8k+4.

Table of values

n a(n)
1 0
2 1
3 0
4 2
5 0
6 2
7 0
8 3
9 0
10 4
11 0
12 6
13 0
14 7
15 0
16 9
17 0
18 11
19 0
20 15
21 0
22 18
23 0
24 23
25 0
26 27
27 0
28 34
29 0
30 41
31 0
32 50
33 0
34 59
35 0
36 72
37 0
38 85
39 0
40 103
41 0
42 120
43 0
44 143
45 0
46 167
47 0
48 198
49 0
50 230
51 0
52 270
53 0
54 313
55 0
56 366
57 0
58 422
59 0
60 491
61 0
62 564
63 0
64 653
65 0
66 748
67 0
68 861
69 0
70 984
71 0
72 1130
73 0
74 1287
75 0
76 1471
77 0

List of values

[0, 1, 0, 2, 0, 2, 0, 3, 0, 4, 0, 6, 0, 7, 0, 9, 0, 11, 0, 15, 0, 18, 0, 23, 0, 27, 0, 34, 0, 41, 0, 50, 0, 59, 0, 72, 0, 85, 0, 103, 0, 120, 0, 143, 0, 167, 0, 198, 0, 230, 0, 270, 0, 313, 0, 366, 0, 422, 0, 491, 0, 564, 0, 653, 0, 748, 0, 861, 0, 984, 0, 1130, 0, 1287, 0, 1471, 0]