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 A366587 #9 Apr 22 2025 05:21:21
%S A366587 8,5,6,2,0,0,5,0,7,9,3,7,4,7,7,1,4,9,3,9,7,2,8,1,0,8,9,5,9,5,1,6,0,4,
%T A366587 0,4,9,8,8,4,9,0,3,1,5,8,4,1,3,2,7,1,3,1,8,5,9,6,9,5,5,8,0,3,4,0,3,8,
%U A366587 6,6,0,8,9,6,0,1,1,9,5,9,2,1,0,5,5,5,3,0,9,0,7,8,0,9,2,3,1,4,3,4,9,2,7,3,9
%N A366587 Decimal expansion of the asymptotic mean of the ratio between the number of squarefree divisors and the number of cubefree divisors.
%C A366587 For a positive integer k the ratio between the number of squarefree divisors and the number of cubefree divisors is r(k) = A034444(k)/A073184(k).
%C A366587 r(k) <= 1 with equality if and only if k is squarefree (A005117).
%C A366587 The asymptotic second raw moment is <r(k)^2> = Product_{p prime} (1 - 5/(9*p^2)) = 0.76780883634140395932... and the asymptotic standard deviation is 0.29730736888962774256... .
%F A366587 Equals lim_{m->oo} (1/m) * Sum_{k=1..m} A034444(k)/A073184(k).
%F A366587 Equals Product_{p prime} (1 - 1/(3*p^2)).
%F A366587 In general, the asymptotic mean of the ratio between the number of k-free divisors and the number of (k-1)-free divisors, for k >= 3, is Product_{p prime} (1 - 1/(k*p^2)).
%e A366587 0.85620050793747714939728108959516040498849031584132...
%t A366587 $MaxExtraPrecision = 1000; m = 1000; c = LinearRecurrence[{0, 1/3}, {0, -(2/3)}, m]; RealDigits[Exp[NSum[Indexed[c, n] * PrimeZetaP[n]/n, {n, 2, m}, NSumTerms -> m, WorkingPrecision -> m]], 10, 105][[1]]
%o A366587 (PARI) prodeulerrat(1 - 1/(3*p^2))
%Y A366587 Cf. A005117, A034444, A073184.
%Y A366587 Similar constants: A307869, A308042, A308043, A358659, A361059, A361060, A361061, A361062, A366586 (mean of the inverse ratio).
%K A366587 nonn,cons
%O A366587 0,1
%A A366587 _Amiram Eldar_, Oct 14 2023