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.

A362549 Number of partitions of [n] whose blocks can be ordered such that the i-th block (except possibly the last) has at least i elements and no block j > i has an element smaller than the i-th smallest element of block i.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 9
5 23
6 64
7 187
8 566
9 1777
10 5820
11 19944
12 71343
13 264719
14 1011292
15 3953381
16 15756609
17 63945484
18 264384828
19 1115246518
20 4806957739
21 21189601861
22 95516470253
23 439777682222
24 2064164172616
25 9853934668051
26 47736608806520
27 234235866539512
28 1162618720397931

List of values

[1, 1, 2, 4, 9, 23, 64, 187, 566, 1777, 5820, 19944, 71343, 264719, 1011292, 3953381, 15756609, 63945484, 264384828, 1115246518, 4806957739, 21189601861, 95516470253, 439777682222, 2064164172616, 9853934668051, 47736608806520, 234235866539512, 1162618720397931]