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.

A348702 Square array T(n, k) (n>=1, k>=1) read by antidiagonals upwards. T(n, k) is the number of partitions of the set [n] into lists of k noncrossing sets.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 3
7 1
8 8
9 9
10 4
11 1
12 14
13 27
14 16
15 5
16 1
17 22
18 75
19 64
20 25
21 6
22 1
23 32
24 183
25 244
26 125
27 36
28 7
29 1
30 44
31 393
32 844
33 605
34 216
35 49
36 8
37 1
38 58
39 759
40 2584
41 2725
42 1266
43 343
44 64
45 9
46 1
47 74
48 1347
49 6976
50 11105
51 7026
52 2359
53 512
54 81
55 10
56 1
57 92
58 2235
59 16804
60 40325
61 35976
62 15547
63 4040
64 729
65 100
66 11
67 1
68 112
69 3513
70 36724
71 129925
72 166956
73 95977

List of values

[1, 1, 2, 1, 4, 3, 1, 8, 9, 4, 1, 14, 27, 16, 5, 1, 22, 75, 64, 25, 6, 1, 32, 183, 244, 125, 36, 7, 1, 44, 393, 844, 605, 216, 49, 8, 1, 58, 759, 2584, 2725, 1266, 343, 64, 9, 1, 74, 1347, 6976, 11105, 7026, 2359, 512, 81, 10, 1, 92, 2235, 16804, 40325, 35976, 15547, 4040, 729, 100, 11, 1, 112, 3513, 36724, 129925, 166956, 95977]