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.

A035366 Number of partitions of n into parts 4k+2 or 4k+3.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 1
6 3
7 2
8 3
9 4
10 5
11 5
12 8
13 8
14 11
15 12
16 15
17 17
18 22
19 23
20 30
21 34
22 40
23 45
24 56
25 61
26 73
27 83
28 98
29 109
30 130
31 144
32 169
33 190
34 219
35 246
36 286
37 317
38 365
39 410
40 467
41 521
42 597
43 663
44 754
45 841
46 950
47 1058
48 1196
49 1326
50 1494
51 1661
52 1861
53 2064
54 2315
55 2561
56 2862
57 3169
58 3531

List of values

[0, 1, 1, 1, 1, 3, 2, 3, 4, 5, 5, 8, 8, 11, 12, 15, 17, 22, 23, 30, 34, 40, 45, 56, 61, 73, 83, 98, 109, 130, 144, 169, 190, 219, 246, 286, 317, 365, 410, 467, 521, 597, 663, 754, 841, 950, 1058, 1196, 1326, 1494, 1661, 1861, 2064, 2315, 2561, 2862, 3169, 3531]