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.

A271466 Number T(n,k) of set partitions of [n] such that k is the largest element of the last block; triangle T(n,k), n>=1, 1<=k<=n, read by rows.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 1
6 4
7 0
8 1
9 4
10 10
11 0
12 1
13 6
14 15
15 30
16 0
17 1
18 10
19 29
20 59
21 104
22 0
23 1
24 18
25 63
26 139
27 250
28 406
29 0
30 1
31 34
32 149
33 365
34 692
35 1145
36 1754
37 0
38 1
39 66
40 375
41 1039
42 2110
43 3627
44 5649
45 8280
46 0
47 1
48 130
49 989
50 3149
51 6932
52 12521
53 20085
54 29874
55 42294
56 0
57 1
58 258
59 2703
60 10039
61 24190
62 46299
63 77133
64 117488
65 168509
66 231950

List of values

[1, 0, 2, 0, 1, 4, 0, 1, 4, 10, 0, 1, 6, 15, 30, 0, 1, 10, 29, 59, 104, 0, 1, 18, 63, 139, 250, 406, 0, 1, 34, 149, 365, 692, 1145, 1754, 0, 1, 66, 375, 1039, 2110, 3627, 5649, 8280, 0, 1, 130, 989, 3149, 6932, 12521, 20085, 29874, 42294, 0, 1, 258, 2703, 10039, 24190, 46299, 77133, 117488, 168509, 231950]