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.

A325182 Number of integer partitions of n 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)
0 0
1 0
2 0
3 2
4 2
5 1
6 2
7 4
8 7
9 6
10 5
11 4
12 5
13 9
14 12
15 15
16 14
17 12
18 10
19 9
20 11
21 15
22 21
23 24
24 28
25 26
26 24
27 20
28 18
29 17
30 19
31 25
32 31
33 38
34 42
35 46
36 44
37 41
38 36
39 32
40 29
41 28
42 31
43 37
44 46
45 53
46 62
47 66
48 71
49 68
50 65
51 58
52 53
53 47
54 44
55 43
56 46
57 54
58 63
59 74
60 83
61 93
62 98
63 103
64 100
65 96
66 88
67 81

List of values

[0, 0, 0, 2, 2, 1, 2, 4, 7, 6, 5, 4, 5, 9, 12, 15, 14, 12, 10, 9, 11, 15, 21, 24, 28, 26, 24, 20, 18, 17, 19, 25, 31, 38, 42, 46, 44, 41, 36, 32, 29, 28, 31, 37, 46, 53, 62, 66, 71, 68, 65, 58, 53, 47, 44, 43, 46, 54, 63, 74, 83, 93, 98, 103, 100, 96, 88, 81]