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.

A325181 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 1.

Table of values

n a(n)
0 0
1 0
2 2
3 1
4 0
5 2
6 3
7 2
8 1
9 0
10 2
11 3
12 4
13 3
14 2
15 1
16 0
17 2
18 3
19 4
20 5
21 4
22 3
23 2
24 1
25 0
26 2
27 3
28 4
29 5
30 6
31 5
32 4
33 3
34 2
35 1
36 0
37 2
38 3
39 4
40 5
41 6
42 7
43 6
44 5
45 4
46 3
47 2
48 1
49 0
50 2
51 3
52 4
53 5
54 6
55 7
56 8
57 7
58 6
59 5
60 4
61 3
62 2
63 1
64 0
65 2
66 3
67 4
68 5
69 6
70 7
71 8
72 9
73 8
74 7
75 6
76 5
77 4
78 3
79 2
80 1
81 0
82 2
83 3
84 4
85 5
86 6

List of values

[0, 0, 2, 1, 0, 2, 3, 2, 1, 0, 2, 3, 4, 3, 2, 1, 0, 2, 3, 4, 5, 4, 3, 2, 1, 0, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 0, 2, 3, 4, 5, 6, 7, 6, 5, 4, 3, 2, 1, 0, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 0, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 2, 3, 4, 5, 6]