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 A258668 #6 Jun 07 2015 06:19:31 %S A258668 0,1,1,2,9,333,436140,43079658188,416768277321177570, %T A258668 479533252041533318548951081,82915824358567616469138110469031459201, %U A258668 2733701379858734057121091262990514105871808751388190,21440005073020480325389224271234447054906430340227337359088146738881 %N A258668 Number of partitions of (n-1)! into parts that are at most n. %H A258668 Vaclav Kotesovec, <a href="/A258668/b258668.txt">Table of n, a(n) for n = 0..32</a> %H A258668 A. V. Sills and D. Zeilberger, <a href="http://arxiv.org/abs/1108.4391">Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)</a> (arXiv:1108.4391 [math.CO]) %F A258668 a(n) ~ (n!)^(n-3) / n^(n-2). %Y A258668 Cf. A236810, A237998, A238000, A258669, A258670, A258671. %K A258668 nonn %O A258668 0,4 %A A258668 _Vaclav Kotesovec_, Jun 07 2015