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.

A364207 Number of partitions of [n] such that the minimal element of each block is also its size.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 0
5 0
6 3
7 1
8 0
9 0
10 60
11 45
12 53
13 24
14 7
15 12601
16 15120
17 33390
18 55710
19 66522
20 86037
21 37907754
22 63130067
23 202203684
24 511378789
25 1421634137
26 2566309603
27 5855352202
28 2064277450957
29 4418631559288
30 18485494082571
31 61020702809287
32 232959438927000
33 783244248553960

List of values

[1, 1, 0, 1, 0, 0, 3, 1, 0, 0, 60, 45, 53, 24, 7, 12601, 15120, 33390, 55710, 66522, 86037, 37907754, 63130067, 202203684, 511378789, 1421634137, 2566309603, 5855352202, 2064277450957, 4418631559288, 18485494082571, 61020702809287, 232959438927000, 783244248553960]