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.

A348576 Triangle read by rows: T(n,k) is the number of ordered partitions of [n] into k nonempty subsets, in which the first subset has size at least 2, n >= 1 and 1 <= k <= n.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 3
6 0
7 1
8 10
9 12
10 0
11 1
12 25
13 80
14 60
15 0
16 1
17 56
18 360
19 660
20 360
21 0
22 1
23 119
24 1372
25 4620
26 5880
27 2520
28 0
29 1
30 246
31 4788
32 26376
33 58800
34 57120
35 20160
36 0
37 1
38 501
39 15864
40 134316
41 466704
42 771120
43 604800
44 181440
45 0
46 1
47 1012
48 50880
49 637020
50 3238200
51 8094240
52 10584000
53 6955200
54 1814400
55 0

List of values

[0, 1, 0, 1, 3, 0, 1, 10, 12, 0, 1, 25, 80, 60, 0, 1, 56, 360, 660, 360, 0, 1, 119, 1372, 4620, 5880, 2520, 0, 1, 246, 4788, 26376, 58800, 57120, 20160, 0, 1, 501, 15864, 134316, 466704, 771120, 604800, 181440, 0, 1, 1012, 50880, 637020, 3238200, 8094240, 10584000, 6955200, 1814400, 0]