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.

A247231 Triangular array read by rows: T(n,k) is the number of ways to partition an n-set into exactly k blocks and then partially order the blocks, n>=1, 1<=k<=n.

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 9
6 19
7 1
8 21
9 114
10 219
11 1
12 45
13 475
14 2190
15 4231
16 1
17 93
18 1710
19 14235
20 63465
21 130023
22 1
23 189
24 5719
25 76650
26 592340
27 2730483
28 6129859
29 1
30 381
31 18354
32 372519
33 4442550
34 34586118
35 171636052
36 431723379
37 1
38 765
39 57475
40 1701630
41 29409681
42 344040858
43 2831994858
44 15542041644
45 44511042511

List of values

[1, 1, 3, 1, 9, 19, 1, 21, 114, 219, 1, 45, 475, 2190, 4231, 1, 93, 1710, 14235, 63465, 130023, 1, 189, 5719, 76650, 592340, 2730483, 6129859, 1, 381, 18354, 372519, 4442550, 34586118, 171636052, 431723379, 1, 765, 57475, 1701630, 29409681, 344040858, 2831994858, 15542041644, 44511042511]