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 A258672 #6 Jun 07 2015 06:20:41 %S A258672 0,1,5,61,2280,273052,110537709,156456474138,790541795804221, %T A258672 14445283925963101577,963056085414756870071490, %U A258672 235864774408401842540220265704,213426797830699546133563821747980513,717147073290996884137625501875655000693923 %N A258672 Number of partitions of n*2^n into parts that are at most n. %C A258672 Conjecture: If f(n) >= O(n^4) then "number of partitions of f(n) into parts that are at most n" is asymptotic to f(n)^(n-1) / (n!*(n-1)!). For the examples see A238016 and A238010. %H A258672 Vaclav Kotesovec, <a href="/A258672/b258672.txt">Table of n, a(n) for n = 0..59</a> %H A258672 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 A258672 a(n) ~ n^n * 2^(n*(n-1)) / (n!)^2. %Y A258672 Cf. A236810, A237998, A238000, A238010, A238016. %K A258672 nonn %O A258672 0,3 %A A258672 _Vaclav Kotesovec_, Jun 07 2015