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.

A035468 Number of partitions of n into parts 8k+6 or 8k+7.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 0
9 0
10 0
11 0
12 1
13 1
14 2
15 1
16 0
17 0
18 1
19 1
20 2
21 3
22 2
23 1
24 1
25 1
26 2
27 3
28 5
29 4
30 4
31 2
32 2
33 3
34 5
35 7
36 8
37 7
38 5
39 4
40 5
41 7
42 12
43 12
44 13
45 11
46 9
47 8
48 12
49 16
50 19
51 21
52 20
53 17
54 16
55 17
56 24
57 28
58 33
59 33
60 33
61 28
62 29
63 34
64 41
65 48
66 54
67 53
68 50
69 48
70 52
71 58
72 72
73 79
74 85
75 83
76 81
77 80
78 88
79 100
80 116
81 127

List of values

[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 2, 1, 0, 0, 1, 1, 2, 3, 2, 1, 1, 1, 2, 3, 5, 4, 4, 2, 2, 3, 5, 7, 8, 7, 5, 4, 5, 7, 12, 12, 13, 11, 9, 8, 12, 16, 19, 21, 20, 17, 16, 17, 24, 28, 33, 33, 33, 28, 29, 34, 41, 48, 54, 53, 50, 48, 52, 58, 72, 79, 85, 83, 81, 80, 88, 100, 116, 127]