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.

A035692 Number of partitions of n into parts 8k+3 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 0
9 1
10 0
11 0
12 1
13 0
14 0
15 2
16 0
17 2
18 2
19 0
20 2
21 3
22 0
23 4
24 3
25 3
26 4
27 4
28 4
29 6
30 4
31 8
32 6
33 9
34 9
35 8
36 11
37 13
38 8
39 19
40 14
41 15
42 21
43 18
44 19
45 30
46 19
47 32
48 32
49 29
50 38
51 41
52 36
53 53
54 43
55 56
56 59
57 59
58 67
59 75
60 70
61 93
62 81
63 102
64 105
65 105
66 122
67 133
68 123
69 165
70 145
71 170
72 189
73 183
74 203
75 237

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 2, 2, 0, 2, 3, 0, 4, 3, 3, 4, 4, 4, 6, 4, 8, 6, 9, 9, 8, 11, 13, 8, 19, 14, 15, 21, 18, 19, 30, 19, 32, 32, 29, 38, 41, 36, 53, 43, 56, 59, 59, 67, 75, 70, 93, 81, 102, 105, 105, 122, 133, 123, 165, 145, 170, 189, 183, 203, 237]