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.

A362924 Triangle read by rows: T(n,m), n >= 1, 1 <= 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)
1 1
2 2
3 1
4 5
5 4
6 1
7 15
8 13
9 8
10 1
11 52
12 47
13 35
14 16
15 1
16 203
17 188
18 153
19 97
20 32
21 1
22 877
23 825
24 706
25 515
26 275
27 64
28 1
29 4140
30 3937
31 3479
32 2744
33 1785
34 793
35 128
36 1
37 21147
38 20270
39 18313
40 15177
41 11002
42 6347
43 2315
44 256
45 1
46 115975
47 111835
48 102678
49 88033
50 68303
51 45368
52 23073
53 6817
54 512
55 1
56 678570
57 657423
58 610989
59 536882
60 436297
61 316305
62 191866
63 85475
64 20195
65 1024
66 1

List of values

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