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.

A270954 Number of set partitions of [n] having no 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 4
4 9
5 25
6 84
7 323
8 1377
9 6412
10 32312
11 174941
12 1011357
13 6210298
14 40323011
15 275763910
16 1979709852
17 14875239212
18 116679269248
19 953201694216
20 8093501305721
21 71291395351760
22 650357174742217
23 6134966541625355
24 59759476024690454
25 600309156303711764

List of values

[1, 1, 2, 4, 9, 25, 84, 323, 1377, 6412, 32312, 174941, 1011357, 6210298, 40323011, 275763910, 1979709852, 14875239212, 116679269248, 953201694216, 8093501305721, 71291395351760, 650357174742217, 6134966541625355, 59759476024690454, 600309156303711764]