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 A258669 #5 Jun 07 2015 06:19:54 %S A258669 0,1,3,19,1033,1302311,74312057469,291484874476601933, %T A258669 109290159404495354765494065,5262212497884462986538879797523944401, %U A258669 42425405450182072688801993326226988336684453926401,72600595215718916449806606426629386781199080157371905867835756161 %N A258669 Number of partitions of 2*n! into parts that are at most n. %H A258669 Vaclav Kotesovec, <a href="/A258669/b258669.txt">Table of n, a(n) for n = 0..31</a> %H A258669 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 A258669 a(n) ~ n * 2^(n-1) * (n!)^(n-3). %Y A258669 Cf. A236810, A237998, A238000, A258668, A258670, A258671. %K A258669 nonn %O A258669 0,3 %A A258669 _Vaclav Kotesovec_, Jun 07 2015