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 A370444 #11 Feb 18 2024 14:57:20
%S A370444 1,4,40,460,5940,82060,1188140,17792060,273299640,4282438360,
%T A370444 68184114040,1099949668960,17940069922740,295334808497460,
%U A370444 4900888478007740,81893191113037760,1376770060020516140,23270650287508521860,395214289798485048340,6740892510015481994360,115419341703097589417340
%N A370444 Expansion of g.f. A(q) satisfying -4 = Product_{n>=0} (1 - 5*q^n*A(q)).
%H A370444 Paul D. Hanna, <a href="/A370444/b370444.txt">Table of n, a(n) for n = 0..300</a>
%F A370444 G.f. A(q) = Sum_{n>=0} a(n)*q^n satisfies the following formulas.
%F A370444 (1) -4 = Product_{n>=0} (1 - 5*q^n*A(q)).
%F A370444 (2) -4 = Sum_{n>=0} (-5)^n * q^(n*(n-1)/2) * A(q)^n / Product_{k=1..n} (1 - q^k).
%F A370444 (3) A(q) = lim_{n->oo} R_{n}(q) / R_{n+1}(q) where R_{n}(q) = faq(n,q) * [x^n] 5/(1 + 4*e_q(5*x,q)), e_q(x,q) is the q-exponential of x and faq(n,q) is the q-factorial of n.
%F A370444 a(n) ~ c * d^n / n^(3/2), where d = 18.4404204270365344730849662390340654154532966962429860615573702674131... and c = 0.52704660567512847547508143537941958515989557138934496501237493733513... - _Vaclav Kotesovec_, Feb 18 2024
%e A370444 G.f.: A(q) = 1 + 4*q + 40*q^2 + 460*q^3 + 5940*q^4 + 82060*q^5 + 1188140*q^6 + 17792060*q^7 + 273299640*q^8 + 4282438360*q^9 + 68184114040*q^10 + ...
%e A370444 where A(q) satisfies the infinite product
%e A370444 -4 = (1 - 5*A(q)) * (1 - 5*q*A(q)) * (1 - 5*q^2*A(q)) * (1 - 5*q^3*A(q)) * (1 - 5*q^4*A(q)) * (1 - 5*q^5*A(q)) * ...
%t A370444 (* Calculation of constants {d,c}: *) With[{m = 5}, {1/r, -s*Log[r] * Sqrt[r*Derivative[0, 1][QPochhammer][m*s, r] / (2*Pi*(m - 1)*QPolyGamma[1, Log[m*s]/Log[r], r])]} /. FindRoot[{m + QPochhammer[m*s, r] == 1, Log[1 - r] + QPolyGamma[0, Log[m*s]/Log[r], r] == 0}, {r, 1/m^2}, {s, 2}, WorkingPrecision -> 70]] (* _Vaclav Kotesovec_, Feb 18 2024 *)
%o A370444 (PARI) /* A(q) satisfies -4 = Product_{n>=0} (1 - 5*q^n*A(q)) */
%o A370444 {a(n) = my(A=[1]); for(i=1,n, A = concat(A,0);
%o A370444 A[#A] = polcoeff( 4 + prod(k=0,#A, 1 - 5*x^k*Ser(A)) /5, #A-1, x) ); H=A; A[n+1]}
%o A370444 for(n=0,30, print1(a(n),", "))
%o A370444 (PARI) /* limit_{n->oo} R_{n}(q) / R_{n+1}(q) */
%o A370444 {faq(n,q) = prod(j=1, n, (q^j-1)/(q-1))} \\ q-factorial of n
%o A370444 {R(n) = faq(n,q) * polcoeff( 5/(1 + 4*sum(m=0, n, (5*x)^m/faq(m,q) + x*O(x^(n+2)))), n, x)}
%o A370444 {a(n) = polcoeff(R(n+1)/R(n+2) + q*O(q^n), n, q)}
%o A370444 for(n=0,30, print1(a(n),", "))
%Y A370444 Cf. A152807, A370442, A370443, A370445.
%K A370444 nonn
%O A370444 0,2
%A A370444 _Paul D. Hanna_, Feb 18 2024