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.

A374320 Number of partitions of [n] such that the number of blocks of size k is a multiple of k for every k.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 16
6 46
7 106
8 316
9 1604
10 8156
11 33716
12 125456
13 1073216
14 10233224
15 69873896
16 364469561
17 2296961801
18 19124734801
19 147200743489
20 960313414036
21 6422446261456
22 52845891370966
23 461844834503746
24 3779922654292324
25 31131912140021452
26 296987899271509252

List of values

[1, 1, 1, 1, 4, 16, 46, 106, 316, 1604, 8156, 33716, 125456, 1073216, 10233224, 69873896, 364469561, 2296961801, 19124734801, 147200743489, 960313414036, 6422446261456, 52845891370966, 461844834503746, 3779922654292324, 31131912140021452, 296987899271509252]