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.

A035686 Number of partitions of n into parts 8k+2 and 8k+4 with at least one part of each type.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 0
10 2
11 0
12 2
13 0
14 5
15 0
16 5
17 0
18 8
19 0
20 8
21 0
22 14
23 0
24 15
25 0
26 22
27 0
28 23
29 0
30 34
31 0
32 37
33 0
34 51
35 0
36 54
37 0
38 74
39 0
40 81
41 0
42 107
43 0
44 116
45 0
46 150
47 0
48 165
49 0
50 210
51 0
52 229
53 0
54 287
55 0
56 316
57 0
58 392
59 0
60 430
61 0
62 526
63 0
64 580
65 0
66 704
67 0
68 774
69 0
70 929
71 0
72 1024
73 0
74 1223
75 0
76 1347
77 0

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 0, 5, 0, 5, 0, 8, 0, 8, 0, 14, 0, 15, 0, 22, 0, 23, 0, 34, 0, 37, 0, 51, 0, 54, 0, 74, 0, 81, 0, 107, 0, 116, 0, 150, 0, 165, 0, 210, 0, 229, 0, 287, 0, 316, 0, 392, 0, 430, 0, 526, 0, 580, 0, 704, 0, 774, 0, 929, 0, 1024, 0, 1223, 0, 1347, 0]