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.

A035699 Number of partitions of n into parts 8k+6 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 0
11 0
12 0
13 1
14 0
15 0
16 0
17 0
18 0
19 1
20 1
21 2
22 0
23 0
24 0
25 1
26 1
27 3
28 2
29 3
30 0
31 1
32 1
33 3
34 3
35 6
36 4
37 5
38 1
39 3
40 3
41 7
42 7
43 11
44 7
45 8
46 3
47 7
48 8
49 15
50 13
51 19
52 12
53 13
54 8
55 16
56 17
57 27
58 24
59 30
60 20
61 23
62 18
63 32
64 32
65 46
66 40
67 48
68 34
69 41
70 37
71 56
72 57
73 76
74 66
75 76
76 58
77 71
78 67
79 97
80 96
81 122
82 105
83 119

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 2, 0, 0, 0, 1, 1, 3, 2, 3, 0, 1, 1, 3, 3, 6, 4, 5, 1, 3, 3, 7, 7, 11, 7, 8, 3, 7, 8, 15, 13, 19, 12, 13, 8, 16, 17, 27, 24, 30, 20, 23, 18, 32, 32, 46, 40, 48, 34, 41, 37, 56, 57, 76, 66, 76, 58, 71, 67, 97, 96, 122, 105, 119]