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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 1
8 1
9 1
10 1
11 2
12 1
13 4
14 2
15 4
16 4
17 5
18 4
19 7
20 5
21 10
22 7
23 12
24 11
25 14
26 13
27 18
28 15
29 24
30 19
31 28
32 27
33 33
34 31
35 42
36 36
37 51
38 45
39 60
40 58
41 71
42 68
43 87
44 79
45 103
46 96
47 120
48 118
49 141
50 137
51 169
52 159
53 197
54 189
55 228
56 226
57 266
58 262
59 314
60 302
61 362
62 355
63 416
64 416
65 482
66 478
67 561
68 550

List of values

[0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 10, 7, 12, 11, 14, 13, 18, 15, 24, 19, 28, 27, 33, 31, 42, 36, 51, 45, 60, 58, 71, 68, 87, 79, 103, 96, 120, 118, 141, 137, 169, 159, 197, 189, 228, 226, 266, 262, 314, 302, 362, 355, 416, 416, 482, 478, 561, 550]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.