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.

A035460 Number of partitions of n into parts 8k+3 or 8k+5.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 1
10 1
11 2
12 1
13 2
14 2
15 2
16 3
17 2
18 3
19 4
20 3
21 5
22 5
23 4
24 7
25 6
26 7
27 9
28 7
29 10
30 11
31 10
32 14
33 13
34 14
35 18
36 16
37 20
38 22
39 21
40 27
41 26
42 29
43 34
44 32
45 39
46 41
47 41
48 51
49 49
50 54
51 63
52 60
53 71
54 76
55 76
56 90
57 91
58 98
59 111
60 110
61 125
62 133
63 137
64 157
65 159
66 172
67 191
68 192
69 216
70 229
71 235
72 266
73 272

List of values

[1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 2, 1, 2, 2, 2, 3, 2, 3, 4, 3, 5, 5, 4, 7, 6, 7, 9, 7, 10, 11, 10, 14, 13, 14, 18, 16, 20, 22, 21, 27, 26, 29, 34, 32, 39, 41, 41, 51, 49, 54, 63, 60, 71, 76, 76, 90, 91, 98, 111, 110, 125, 133, 137, 157, 159, 172, 191, 192, 216, 229, 235, 266, 272]