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.

A035691 Number of partitions of n into parts 8k+3 and 8k+5 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 0
11 1
12 0
13 1
14 1
15 0
16 3
17 1
18 1
19 3
20 1
21 3
22 3
23 2
24 6
25 3
26 4
27 7
28 4
29 8
30 7
31 6
32 13
33 8
34 10
35 15
36 10
37 17
38 17
39 14
40 24
41 19
42 22
43 30
44 23
45 33
46 34
47 31
48 46
49 39
50 44
51 56
52 47
53 63
54 65
55 61
56 82
57 75
58 84
59 101
60 90
61 113
62 118
63 115
64 145
65 137
66 151
67 176
68 165
69 197
70 207
71 206
72 246
73 242
74 264

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 3, 1, 1, 3, 1, 3, 3, 2, 6, 3, 4, 7, 4, 8, 7, 6, 13, 8, 10, 15, 10, 17, 17, 14, 24, 19, 22, 30, 23, 33, 34, 31, 46, 39, 44, 56, 47, 63, 65, 61, 82, 75, 84, 101, 90, 113, 118, 115, 145, 137, 151, 176, 165, 197, 207, 206, 246, 242, 264]