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.

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

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 3
5 0
6 4
7 0
8 10
9 0
10 13
11 0
12 28
13 0
14 37
15 0
16 72
17 0
18 96
19 0
20 172
21 0
22 230
23 0
24 391
25 0
26 522
27 0
28 846
29 0
30 1129
31 0
32 1766
33 0
34 2348
35 0
36 3564
37 0
38 4722
39 0
40 6992
41 0
42 9226
43 0
44 13371
45 0
46 17568
47 0
48 25006
49 0
50 32708
51 0
52 45817
53 0
54 59668
55 0
56 82430
57 0
58 106874
59 0
60 145830
61 0
62 188260
63 0

List of values

[1, 0, 1, 0, 3, 0, 4, 0, 10, 0, 13, 0, 28, 0, 37, 0, 72, 0, 96, 0, 172, 0, 230, 0, 391, 0, 522, 0, 846, 0, 1129, 0, 1766, 0, 2348, 0, 3564, 0, 4722, 0, 6992, 0, 9226, 0, 13371, 0, 17568, 0, 25006, 0, 32708, 0, 45817, 0, 59668, 0, 82430, 0, 106874, 0, 145830, 0, 188260, 0]