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.

A035693 Number of partitions of n into parts 8k+3 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 0
10 1
11 0
12 0
13 1
14 0
15 0
16 1
17 1
18 2
19 1
20 1
21 2
22 1
23 1
24 3
25 3
26 4
27 3
28 3
29 5
30 3
31 4
32 7
33 7
34 8
35 7
36 8
37 10
38 8
39 10
40 15
41 14
42 15
43 16
44 16
45 20
46 18
47 21
48 29
49 27
50 28
51 32
52 33
53 36
54 37
55 42
56 51
57 50
58 52
59 59
60 60
61 66
62 69
63 77
64 90
65 88
66 93
67 105
68 107
69 115
70 124
71 135
72 152
73 153
74 160
75 180
76 183
77 195

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 1, 1, 3, 3, 4, 3, 3, 5, 3, 4, 7, 7, 8, 7, 8, 10, 8, 10, 15, 14, 15, 16, 16, 20, 18, 21, 29, 27, 28, 32, 33, 36, 37, 42, 51, 50, 52, 59, 60, 66, 69, 77, 90, 88, 93, 105, 107, 115, 124, 135, 152, 153, 160, 180, 183, 195]