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.

A325771 Rectangular array: row n shows the number of parts in all partitions of n that are == k (mod 2), for k = 0, 1.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 5
7 4
8 8
9 5
10 15
11 11
12 24
13 15
14 39
15 28
16 58
17 38
18 90
19 62
20 130
21 85
22 190
23 131
24 268
25 177
26 379
27 258
28 522
29 346
30 722
31 489
32 974
33 648
34 1317
35 890
36 1754
37 1168
38 2330
39 1572
40 3058
41 2042
42 4010
43 2699
44 5200
45 3475
46 6731
47 4532
48 8642
49 5783
50 11068
51 7446
52 14076
53 9430

List of values

[0, 1, 1, 2, 1, 5, 4, 8, 5, 15, 11, 24, 15, 39, 28, 58, 38, 90, 62, 130, 85, 190, 131, 268, 177, 379, 258, 522, 346, 722, 489, 974, 648, 1317, 890, 1754, 1168, 2330, 1572, 3058, 2042, 4010, 2699, 5200, 3475, 6731, 4532, 8642, 5783, 11068, 7446, 14076, 9430]