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.

A325180 Heinz number of integer partitions such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 2.

Table of values

n a(n)
1 5
2 8
3 10
4 12
5 20
6 21
7 35
8 36
9 42
10 49
11 54
12 60
13 63
14 70
15 81
16 84
17 90
18 98
19 100
20 105
21 126
22 135
23 140
24 147
25 150
26 189
27 196
28 210
29 225
30 275
31 294
32 315
33 385
34 441
35 500
36 539
37 550
38 605
39 700
40 750
41 770
42 825
43 847
44 980
45 1050
46 1078
47 1100
48 1125
49 1155
50 1210
51 1250
52 1331
53 1372
54 1375

List of values

[5, 8, 10, 12, 20, 21, 35, 36, 42, 49, 54, 60, 63, 70, 81, 84, 90, 98, 100, 105, 126, 135, 140, 147, 150, 189, 196, 210, 225, 275, 294, 315, 385, 441, 500, 539, 550, 605, 700, 750, 770, 825, 847, 980, 1050, 1078, 1100, 1125, 1155, 1210, 1250, 1331, 1372, 1375]