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.

A035459 Number of partitions of n into parts 8k+3 or 8k+4.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 0
6 1
7 1
8 1
9 1
10 1
11 2
12 3
13 1
14 2
15 4
16 3
17 2
18 4
19 5
20 5
21 4
22 6
23 8
24 8
25 6
26 9
27 12
28 11
29 9
30 14
31 17
32 15
33 15
34 20
35 23
36 23
37 21
38 28
39 34
40 31
41 30
42 41
43 45
44 43
45 44
46 55
47 62
48 60
49 60
50 76
51 84
52 80
53 83
54 103
55 112
56 108
57 114
58 138
59 148
60 146
61 153
62 182
63 197
64 192
65 203
66 243
67 256
68 252
69 272
70 315
71 333

List of values

[0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 3, 1, 2, 4, 3, 2, 4, 5, 5, 4, 6, 8, 8, 6, 9, 12, 11, 9, 14, 17, 15, 15, 20, 23, 23, 21, 28, 34, 31, 30, 41, 45, 43, 44, 55, 62, 60, 60, 76, 84, 80, 83, 103, 112, 108, 114, 138, 148, 146, 153, 182, 197, 192, 203, 243, 256, 252, 272, 315, 333]