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.

A303944 Number of partitions of n into at most 1^2 copy of 1, 2^2 copies of 2, 3^2 copies of 3, ... .

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 6
7 8
8 11
9 15
10 19
11 25
12 34
13 43
14 55
15 71
16 90
17 113
18 143
19 178
20 222
21 276
22 340
23 418
24 515
25 628
26 765
27 931
28 1128
29 1362
30 1643
31 1974
32 2369
33 2836
34 3385
35 4033
36 4800
37 5694
38 6745
39 7978
40 9418
41 11096
42 13057
43 15334
44 17985
45 21062
46 24626
47 28753
48 33534
49 39045
50 45408
51 52744
52 61187

List of values

[1, 1, 1, 2, 3, 4, 6, 8, 11, 15, 19, 25, 34, 43, 55, 71, 90, 113, 143, 178, 222, 276, 340, 418, 515, 628, 765, 931, 1128, 1362, 1643, 1974, 2369, 2836, 3385, 4033, 4800, 5694, 6745, 7978, 9418, 11096, 13057, 15334, 17985, 21062, 24626, 28753, 33534, 39045, 45408, 52744, 61187]