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.

A250119 Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 123454, 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 10
15 1
16 1
17 31
18 90
19 65
20 14
21 1
22 1
23 63
24 301
25 350
26 121
27 18
28 1
29 1
30 127
31 966
32 1701
33 834
34 193
35 22
36 1
37 1
38 255
39 3025
40 7770
41 5037
42 1606
43 281
44 26
45 1
46 1
47 511
48 9330
49 34105
50 27918
51 11461
52 2730
53 385
54 30
55 1
56 1
57 1023
58 28501
59 145750
60 145777
61 73762
62 22381
63 4270
64 505
65 34
66 1

List of values

[1, 1, 1, 1, 3, 1, 1, 7, 6, 1, 1, 15, 25, 10, 1, 1, 31, 90, 65, 14, 1, 1, 63, 301, 350, 121, 18, 1, 1, 127, 966, 1701, 834, 193, 22, 1, 1, 255, 3025, 7770, 5037, 1606, 281, 26, 1, 1, 511, 9330, 34105, 27918, 11461, 2730, 385, 30, 1, 1, 1023, 28501, 145750, 145777, 73762, 22381, 4270, 505, 34, 1]