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.

A271206 Number T(n,k) of set partitions of [n] having exactly k triples (t,t+1,t+2) such that t+i is in block b+i for some b; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 10
6 4
7 1
8 28
9 18
10 5
11 1
12 89
13 77
14 30
15 6
16 1
17 315
18 345
19 164
20 45
21 7
22 1
23 1233
24 1617
25 919
26 299
27 63
28 8
29 1
30 5285
31 8003
32 5262
33 2011
34 492
35 84
36 9
37 1
38 24583
39 41871
40 31180
41 13611
42 3857
43 754
44 108
45 10
46 1
47 123062
48 231474
49 191889
50 94020
51 30128
52 6755
53 1095
54 135
55 11
56 1

List of values

[1, 1, 2, 4, 1, 10, 4, 1, 28, 18, 5, 1, 89, 77, 30, 6, 1, 315, 345, 164, 45, 7, 1, 1233, 1617, 919, 299, 63, 8, 1, 5285, 8003, 5262, 2011, 492, 84, 9, 1, 24583, 41871, 31180, 13611, 3857, 754, 108, 10, 1, 123062, 231474, 191889, 94020, 30128, 6755, 1095, 135, 11, 1]