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.

A270953 Number T(n,k) of set partitions of [n] having exactly k pairs (m,m+1) such that m+1 is in some block b and m is in block b+1; triangle T(n,k), n>=0, 0<=k<=n-floor((1+sqrt(max(0,8n-7)))/2), read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 9
6 6
7 25
8 24
9 3
10 84
11 91
12 27
13 1
14 323
15 374
16 159
17 21
18 1377
19 1699
20 857
21 197
22 10
23 6412
24 8410
25 4726
26 1421
27 174
28 4
29 32312
30 44794
31 27385
32 9573
33 1783
34 127
35 1
36 174941
37 254718
38 167097
39 64724
40 15158
41 1856
42 76
43 1011357
44 1538027
45 1071422
46 449567
47 121464
48 20074
49 1650
50 36

List of values

[1, 1, 2, 4, 1, 9, 6, 25, 24, 3, 84, 91, 27, 1, 323, 374, 159, 21, 1377, 1699, 857, 197, 10, 6412, 8410, 4726, 1421, 174, 4, 32312, 44794, 27385, 9573, 1783, 127, 1, 174941, 254718, 167097, 64724, 15158, 1856, 76, 1011357, 1538027, 1071422, 449567, 121464, 20074, 1650, 36]