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.

A002221 a(n) is the number of partitions of 4n that can be obtained by adding together four (not necessarily distinct) partitions of n.

Table of values

n a(n)
1 1
2 5
3 15
4 55
5 140
6 448
7 1022
8 2710
9 6048
10 14114
11 28831
12 64091
13 123649
14 251295
15 476835
16 916972
17 1654044
18 3080159
19 5377431
20 9624588
21 16490017
22 28433473
23 47423409
24 80279375

List of values

[1, 5, 15, 55, 140, 448, 1022, 2710, 6048, 14114, 28831, 64091, 123649, 251295, 476835, 916972, 1654044, 3080159, 5377431, 9624588, 16490017, 28433473, 47423409, 80279375]