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 A348088 #24 May 16 2025 16:43:52
%S A348088 1,1,91,24970,14057043,13444400190,19558289594910,40250341173506100,
%T A348088 111335096965772406915,398473840263173643939190,
%U A348088 1791905773077609090895008106,9890754761467721759394797416396,65747198205879568307026776928408110
%N A348088 a(n) = [x^n] Product_{k=1..n} 1/(1 - (2*k-1)^2 * x).
%F A348088 From _Vaclav Kotesovec_, Oct 16 2021, updated May 16 2025: (Start)
%F A348088 a(n) ~ c * d^n * n!^2 / n^(3/2), where d = 52.447924272991536496097233490380538810534457762204101802471270109895148... and c = 0.028365099209561232079163758339093959048662789595134609351298413762...
%F A348088 In closed form, a(n) ~ 2^(2*n) * exp(2*n) * r^(n*r + 1/2) * (1+r)^(4*n) * n^(2*n - 1/2) / (sqrt(Pi*(1 - r*(2+r))) * (2+r)^((2+r)*n - 1/2)), where r = 0.044382033760833484984013906344747760869028157215190550759633... is the root of the equation exp(4/(1+r)) = (1 + 2/r). (End)
%F A348088 a(n) = A381512(n,2*n-1) = (1/(2^(2*n-2)*(2*n-1)!)) * Sum_{k=0..n-1} (-1)^k * (2*n-1-2*k)^(4*n-1) * binomial(2*n-1,k) for n > 0. - _Seiichi Manyama_, May 16 2025
%t A348088 Table[SeriesCoefficient[Product[1/(1 - (2*k-1)^2*x), {k, 1, n}], {x, 0, n}], {n, 0, 20}] (* _Vaclav Kotesovec_, Oct 16 2021 *)
%o A348088 (PARI) a(n) = polcoef(1/prod(k=1, n, 1-(2*k-1)^2*x+x*O(x^n)), n);
%Y A348088 Cf. A001818, A298851, A348082, A348087, A381512.
%K A348088 nonn
%O A348088 0,3
%A A348088 _Seiichi Manyama_, Sep 28 2021