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.

A035689 Number of partitions of n into parts 8k+2 and 8k+7 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 0
9 1
10 0
11 1
12 0
13 1
14 0
15 1
16 1
17 3
18 1
19 3
20 1
21 3
22 1
23 4
24 3
25 7
26 3
27 8
28 3
29 8
30 4
31 10
32 8
33 14
34 9
35 16
36 9
37 18
38 11
39 22
40 17
41 28
42 19
43 32
44 21
45 36
46 25
47 44
48 35
49 52
50 40
51 60
52 44
53 68
54 52
55 82
56 66
57 95
58 76
59 108
60 85
61 123
62 100
63 145
64 122
65 166
66 140
67 188
68 157
69 214
70 182
71 250
72 215
73 283
74 245

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 3, 1, 3, 1, 3, 1, 4, 3, 7, 3, 8, 3, 8, 4, 10, 8, 14, 9, 16, 9, 18, 11, 22, 17, 28, 19, 32, 21, 36, 25, 44, 35, 52, 40, 60, 44, 68, 52, 82, 66, 95, 76, 108, 85, 123, 100, 145, 122, 166, 140, 188, 157, 214, 182, 250, 215, 283, 245]