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 A304992 #5 May 23 2018 04:43:14
%S A304992 1,0,7,18,98,210,969,1938,7037,15258,44815,93180,262391,518550,
%T A304992 1311015,2657328,6189160,12124098,27239760,52063668,111630480,
%U A304992 211503288,432900236,806091180,1610854427,2940167268,5691072911,10289144976,19402974147,34523231688
%N A304992 G.f.: Sum_{k>=0} A000041(k)^3 * x^k / Sum_{k>=0} A000009(k) * x^k.
%C A304992 In general, if m > 1 and g.f. = Sum_{k>=0} A000041(k)^m * x^k / Sum_{k>=0} A000009(k) * x^k, then a(n, m) ~ exp(Pi*sqrt((2*m^2 - 1)*n/3)) * ((2*m^2 - 1)^(m - 1/2) / (2^(3*m - 1) * 3^(m/2) * m^(2*m - 1) * n^m)).
%F A304992 a(n) ~ 289 * sqrt(17/3) * exp(Pi*sqrt(17*n/3)) / (186624*n^3).
%t A304992 nmax = 50; CoefficientList[Series[Sum[PartitionsP[k]^3*x^k, {k, 0, nmax}] / Sum[PartitionsQ[k]*x^k, {k, 0, nmax}], {x, 0, nmax}], x]
%Y A304992 Cf. A000009, A000041, A133042, A260664, A304873, A304878, A304988.
%K A304992 nonn
%O A304992 0,3
%A A304992 _Vaclav Kotesovec_, May 23 2018