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 A197182 #9 Mar 19 2020 22:54:24 %S A197182 1,1,3,7,18,36,82,153,300,520,915,1477,2437,3801,6027,9095,13824, %T A197182 20194,29734,42254,60348,83730,116565,158215,215375,286691,382461, %U A197182 500451,656130,846385,1094530,1395787,1784670,2254093,2853849,3573051,4482825,5565849,6922008 %N A197182 Number of partitions of n^2 into factorial parts. %C A197182 a(n) = A064986(n^2). %H A197182 Alois P. Heinz, <a href="/A197182/b197182.txt">Table of n, a(n) for n = 0..1000</a> %H A197182 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a> %o A197182 (Haskell) %o A197182 a197182 = a064986 . a000290 %Y A197182 Cf. A197183. %K A197182 nonn %O A197182 0,3 %A A197182 _Reinhard Zumkeller_, Dec 04 2011