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.

A035594 Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).

Table of values

n a(n)
0 1
1 1
2 3
3 4
4 10
5 13
6 28
7 37
8 72
9 96
10 172
11 230
12 391
13 522
14 846
15 1129
16 1766
17 2348
18 3564
19 4722
20 6992
21 9226
22 13371
23 17568
24 25006
25 32708
26 45817
27 59668
28 82430
29 106874
30 145830
31 188260
32 254072
33 326608
34 436434
35 558725
36 739966
37 943512
38 1239434
39 1574254
40 2052699
41 2597422

List of values

[1, 1, 3, 4, 10, 13, 28, 37, 72, 96, 172, 230, 391, 522, 846, 1129, 1766, 2348, 3564, 4722, 6992, 9226, 13371, 17568, 25006, 32708, 45817, 59668, 82430, 106874, 145830, 188260, 254072, 326608, 436434, 558725, 739966, 943512, 1239434, 1574254, 2052699, 2597422]