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.

A035688 Number of partitions of n into parts 8k+2 and 8k+6 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 0
7 0
8 1
9 0
10 1
11 0
12 1
13 0
14 2
15 0
16 4
17 0
18 4
19 0
20 5
21 0
22 7
23 0
24 10
25 0
26 12
27 0
28 14
29 0
30 18
31 0
32 24
33 0
34 28
35 0
36 33
37 0
38 41
39 0
40 50
41 0
42 59
43 0
44 70
45 0
46 84
47 0
48 100
49 0
50 117
51 0
52 137
53 0
54 161
55 0
56 188
57 0
58 219
59 0
60 254
61 0
62 295
63 0
64 341
65 0
66 393
67 0
68 453
69 0
70 520
71 0
72 595
73 0
74 682
75 0
76 780
77 0
78 889
79 0

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 4, 0, 4, 0, 5, 0, 7, 0, 10, 0, 12, 0, 14, 0, 18, 0, 24, 0, 28, 0, 33, 0, 41, 0, 50, 0, 59, 0, 70, 0, 84, 0, 100, 0, 117, 0, 137, 0, 161, 0, 188, 0, 219, 0, 254, 0, 295, 0, 341, 0, 393, 0, 453, 0, 520, 0, 595, 0, 682, 0, 780, 0, 889, 0]