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.

A035365 Number of partitions of n into parts 4k+1 or 4k+2.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 6
7 7
8 9
9 11
10 15
11 18
12 23
13 27
14 34
15 41
16 50
17 59
18 72
19 85
20 103
21 120
22 143
23 167
24 198
25 230
26 270
27 313
28 366
29 422
30 491
31 564
32 653
33 748
34 861
35 984
36 1130
37 1287
38 1471
39 1671
40 1905
41 2159
42 2453
43 2772
44 3141
45 3544
46 4004
47 4506
48 5079
49 5705
50 6416
51 7192
52 8070
53 9030

List of values

[1, 2, 2, 3, 4, 6, 7, 9, 11, 15, 18, 23, 27, 34, 41, 50, 59, 72, 85, 103, 120, 143, 167, 198, 230, 270, 313, 366, 422, 491, 564, 653, 748, 861, 984, 1130, 1287, 1471, 1671, 1905, 2159, 2453, 2772, 3141, 3544, 4004, 4506, 5079, 5705, 6416, 7192, 8070, 9030]