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.

A035679 Number of partitions of n into parts 8k+1 and 8k+2 with at least one part of each type.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 2
6 2
7 3
8 3
9 4
10 4
11 7
12 7
13 10
14 10
15 13
16 13
17 16
18 16
19 22
20 23
21 30
22 31
23 38
24 39
25 46
26 47
27 58
28 61
29 75
30 78
31 93
32 96
33 111
34 114
35 134
36 141
37 167
38 176
39 204
40 213
41 242
42 251
43 286
44 301
45 346
46 365
47 416
48 436
49 489
50 509
51 570
52 599
53 676
54 714
55 802
56 844
57 937
58 980
59 1083
60 1138
61 1265

List of values

[0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 7, 7, 10, 10, 13, 13, 16, 16, 22, 23, 30, 31, 38, 39, 46, 47, 58, 61, 75, 78, 93, 96, 111, 114, 134, 141, 167, 176, 204, 213, 242, 251, 286, 301, 346, 365, 416, 436, 489, 509, 570, 599, 676, 714, 802, 844, 937, 980, 1083, 1138, 1265]