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.

A287673 Number of set partitions of [n] such that j is member of block b only if b = 1 or at least one of j-1, ..., j-10 is member of a block >= b-1.

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 15
5 52
6 203
7 877
8 4140
9 21147
10 115975
11 678570
12 4213597
13 27644436
14 190898290
15 1382887161
16 10477990158
17 82819430415
18 681282289857
19 5820296183791
20 51541816775857
21 472306124149579
22 4471549108520595
23 43676154621078016
24 439558508006341652

List of values

[1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, 27644436, 190898290, 1382887161, 10477990158, 82819430415, 681282289857, 5820296183791, 51541816775857, 472306124149579, 4471549108520595, 43676154621078016, 439558508006341652]