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.

A002219 a(n) is the number of partitions of 2n that can be obtained by adding together two (not necessarily distinct) partitions of n.

Table of values

n a(n)
1 1
2 3
3 6
4 14
5 25
6 53
7 89
8 167
9 278
10 480
11 760
12 1273
13 1948
14 3089
15 4682
16 7177
17 10565
18 15869
19 22911
20 33601
21 47942
22 68756
23 96570
24 136883
25 189674
26 264297
27 362995
28 499617
29 678245
30 924522
31 1243098
32 1676339
33 2237625
34 2988351
35 3957525
36 5247500
37 6895946
38 9070144
39 11850304

List of values

[1, 3, 6, 14, 25, 53, 89, 167, 278, 480, 760, 1273, 1948, 3089, 4682, 7177, 10565, 15869, 22911, 33601, 47942, 68756, 96570, 136883, 189674, 264297, 362995, 499617, 678245, 924522, 1243098, 1676339, 2237625, 2988351, 3957525, 5247500, 6895946, 9070144, 11850304]