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.
%I A332259 #6 Feb 08 2020 20:41:27
%S A332259 1,1,3,7,67,121,4551,5041,405371,888721,65326213,39916801,27854708575,
%T A332259 6227020801,5417436748153,6968620334677,2744261072866171,
%U A332259 355687428096001,2984245819328278077,121645100408832001,1177257398964663961517,545405274481512519361
%N A332259 a(n) = n! * [x^n] 1 / (1 - Sum_{d|n} x^d / d!).
%C A332259 Number of ordered set partitions of [n] such that n is a multiple of each block size.
%t A332259 Table[n! SeriesCoefficient[1/(1 - Sum[Boole[Mod[n, k] == 0] x^k/k!, {k, 1, n}]), {x, 0, n}], {n, 0, 22}]
%o A332259 (PARI) a(n) = {n! * polcoef(1/(1 - sumdiv(n, d, x^d/d!) + O(x*x^n)), n)} \\ _Andrew Howroyd_, Feb 08 2020
%Y A332259 Cf. A000670, A275429.
%K A332259 nonn
%O A332259 0,3
%A A332259 _Ilya Gutkovskiy_, Feb 08 2020