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.

A035625 Number of partitions of n into parts 4k+1 and 4k+3 with at least one part of each type.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 1
7 2
8 4
9 4
10 5
11 7
12 10
13 12
14 14
15 18
16 24
17 28
18 33
19 41
20 50
21 59
22 70
23 84
24 100
25 117
26 137
27 161
28 188
29 219
30 254
31 295
32 341
33 393
34 453
35 520
36 595
37 682
38 780
39 889
40 1011
41 1150
42 1307
43 1481
44 1673
45 1893
46 2140
47 2411
48 2713
49 3053
50 3433
51 3851
52 4313
53 4833
54 5411

List of values

[0, 0, 0, 1, 1, 1, 2, 4, 4, 5, 7, 10, 12, 14, 18, 24, 28, 33, 41, 50, 59, 70, 84, 100, 117, 137, 161, 188, 219, 254, 295, 341, 393, 453, 520, 595, 682, 780, 889, 1011, 1150, 1307, 1481, 1673, 1893, 2140, 2411, 2713, 3053, 3433, 3851, 4313, 4833, 5411]