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.

A250118 Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 12343, with m blocks.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 7
9 6
10 1
11 1
12 15
13 25
14 9
15 1
16 1
17 31
18 90
19 52
20 12
21 1
22 1
23 63
24 301
25 246
26 88
27 15
28 1
29 1
30 127
31 966
32 1039
33 510
34 133
35 18
36 1
37 1
38 255
39 3025
40 4083
41 2569
42 909
43 187
44 21
45 1
46 1
47 511
48 9330
49 15274
50 11790
51 5296
52 1470
53 250
54 24
55 1
56 1
57 1023
58 28501
59 55152
60 50644
61 27678
62 9706
63 2220
64 322
65 27
66 1

List of values

[1, 1, 1, 1, 3, 1, 1, 7, 6, 1, 1, 15, 25, 9, 1, 1, 31, 90, 52, 12, 1, 1, 63, 301, 246, 88, 15, 1, 1, 127, 966, 1039, 510, 133, 18, 1, 1, 255, 3025, 4083, 2569, 909, 187, 21, 1, 1, 511, 9330, 15274, 11790, 5296, 1470, 250, 24, 1, 1, 1023, 28501, 55152, 50644, 27678, 9706, 2220, 322, 27, 1]