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.

A270967 Number of set partitions of [n] having the maximal possible number of pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 6
5 3
6 1
7 21
8 10
9 4
10 1
11 76
12 36
13 15
14 5
15 1
16 281
17 133
18 57
19 21
20 6
21 1
22 1052
23 499
24 218
25 85
26 28
27 7
28 1
29 3974
30 1890
31 838
32 339
33 121
34 36
35 8
36 1
37 15113
38 7207
39 3233
40 1343
41 505
42 166
43 45
44 9
45 1
46 57774
47 27622
48 12509
49 5302
50 2069
51 726
52 221
53 55
54 10
55 1
56 221781
57 106289

List of values

[1, 1, 2, 1, 6, 3, 1, 21, 10, 4, 1, 76, 36, 15, 5, 1, 281, 133, 57, 21, 6, 1, 1052, 499, 218, 85, 28, 7, 1, 3974, 1890, 838, 339, 121, 36, 8, 1, 15113, 7207, 3233, 1343, 505, 166, 45, 9, 1, 57774, 27622, 12509, 5302, 2069, 726, 221, 55, 10, 1, 221781, 106289]