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.

A362925 Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 1
6 5
7 5
8 4
9 1
10 15
11 15
12 13
13 8
14 1
15 52
16 52
17 47
18 35
19 16
20 1
21 203
22 203
23 188
24 153
25 97
26 32
27 1
28 877
29 877
30 825
31 706
32 515
33 275
34 64
35 1
36 4140
37 4140
38 3937
39 3479
40 2744
41 1785
42 793
43 128
44 1
45 21147
46 21147
47 20270
48 18313
49 15177
50 11002
51 6347
52 2315
53 256
54 1
55 115975
56 115975
57 111835
58 102678
59 88033
60 68303
61 45368
62 23073
63 6817
64 512
65 1

List of values

[1, 1, 1, 2, 2, 1, 5, 5, 4, 1, 15, 15, 13, 8, 1, 52, 52, 47, 35, 16, 1, 203, 203, 188, 153, 97, 32, 1, 877, 877, 825, 706, 515, 275, 64, 1, 4140, 4140, 3937, 3479, 2744, 1785, 793, 128, 1, 21147, 21147, 20270, 18313, 15177, 11002, 6347, 2315, 256, 1, 115975, 115975, 111835, 102678, 88033, 68303, 45368, 23073, 6817, 512, 1]