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.

A262071 Number T(n,k) of ordered partitions of an n-set with nondecreasing block sizes and maximal block size equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 1
6 0
7 6
8 3
9 1
10 0
11 24
12 18
13 4
14 1
15 0
16 120
17 90
18 30
19 5
20 1
21 0
22 720
23 630
24 200
25 45
26 6
27 1
28 0
29 5040
30 4410
31 1610
32 350
33 63
34 7
35 1
36 0
37 40320
38 37800
39 13440
40 3290
41 560
42 84
43 8
44 1
45 0
46 362880
47 340200
48 130200
49 30870
50 5922
51 840
52 108
53 9
54 1
55 0
56 3628800
57 3515400
58 1327200
59 334950
60 61992
61 9870
62 1200
63 135
64 10
65 1

List of values

[1, 0, 1, 0, 2, 1, 0, 6, 3, 1, 0, 24, 18, 4, 1, 0, 120, 90, 30, 5, 1, 0, 720, 630, 200, 45, 6, 1, 0, 5040, 4410, 1610, 350, 63, 7, 1, 0, 40320, 37800, 13440, 3290, 560, 84, 8, 1, 0, 362880, 340200, 130200, 30870, 5922, 840, 108, 9, 1, 0, 3628800, 3515400, 1327200, 334950, 61992, 9870, 1200, 135, 10, 1]