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.

A262072 Number T(n,k) of partitions of an n-set with distinct block sizes and maximal block size equal to k; triangle T(n,k), n>=0, ceiling((sqrt(1+8*n)-1)/2)<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 1
5 4
6 1
7 10
8 5
9 1
10 60
11 15
12 6
13 1
14 140
15 21
16 7
17 1
18 280
19 224
20 28
21 8
22 1
23 1260
24 630
25 336
26 36
27 9
28 1
29 12600
30 3780
31 1050
32 480
33 45
34 10
35 1
36 34650
37 7392
38 1650
39 660
40 55
41 11
42 1
43 110880
44 74844
45 12672
46 2475
47 880
48 66
49 12
50 1
51 360360
52 276276
53 140712
54 20592
55 3575
56 1144
57 78
58 13
59 1

List of values

[1, 1, 1, 3, 1, 4, 1, 10, 5, 1, 60, 15, 6, 1, 140, 21, 7, 1, 280, 224, 28, 8, 1, 1260, 630, 336, 36, 9, 1, 12600, 3780, 1050, 480, 45, 10, 1, 34650, 7392, 1650, 660, 55, 11, 1, 110880, 74844, 12672, 2475, 880, 66, 12, 1, 360360, 276276, 140712, 20592, 3575, 1144, 78, 13, 1]