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.

A364971 Number T(n,k) of partitions of [n] for which the difference between the longest and the shortest block size is k; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 5
6 6
7 4
8 2
9 35
10 10
11 5
12 27
13 60
14 95
15 15
16 6
17 2
18 371
19 315
20 161
21 21
22 7
23 142
24 938
25 2002
26 770
27 252
28 28
29 8
30 282
31 4005
32 9744
33 5313
34 1386
35 372
36 36
37 9
38 1073
39 16950
40 50275
41 33705
42 11082
43 2310
44 525
45 45
46 10
47 2
48 74657
49 283525
50 217800
51 78078
52 20097
53 3630
54 715
55 55
56 11

List of values

[1, 1, 2, 2, 3, 5, 6, 4, 2, 35, 10, 5, 27, 60, 95, 15, 6, 2, 371, 315, 161, 21, 7, 142, 938, 2002, 770, 252, 28, 8, 282, 4005, 9744, 5313, 1386, 372, 36, 9, 1073, 16950, 50275, 33705, 11082, 2310, 525, 45, 10, 2, 74657, 283525, 217800, 78078, 20097, 3630, 715, 55, 11]