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 A338327 #11 Oct 29 2020 04:54:24
%S A338327 1,2,14,36,234,3510,211297,487425,20136429
%N A338327 a(n) is the least number k such that there are exactly n biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.
%C A338327 a(n) is the least k such that A338326(k) = n.
%C A338327 Dehkordi (1998) proved that for each k>=0 the sequence of numbers m such that A338326(m) = k has a positive asymptotic density. Therefore, this sequence is infinite.
%C A338327 a(9) > 10^10. - _Bert Dobbelaere_, Oct 29 2020
%H A338327 Massoud H. Dehkordi, <a href="https://hdl.handle.net/2134/12177">Asymptotic formulae for some arithmetic functions in number theory</a>, Ph.D. thesis, Loughborough University, 1998.
%e A338327 a(0) = 1 since there are no biquadratefree powerful numbers between 1^2 = 1 and 2^2 = 4.
%e A338327 a(1) = 2 since there is one biquadratefree powerful number, 8 = 2^3, between 2^2 = 4 and 3^2 = 8.
%e A338327 a(2) = 14 since there are 2 biquadratefree powerful numbers, 200 = 2^3 * 5^2 and 216 = 2^3 * 3^3, between 14^2 = 196 and 15^2 = 225.
%t A338327 bqfpowQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], MemberQ[{2, 3 }, #] &]; f[n_] := Count[Range[n^2 + 1, (n + 1)^2 - 1], _?bqfpowQ]; mx = 5; s = Table[0, {mx}]; c = 0; n = 1; While[c < mx, i = f[n] + 1; If[i <= mx && s[[i]] == 0, c++; s[[i]] = n]; n++]; s
%Y A338327 Cf. A119242, A337737, A338325, A338326.
%K A338327 nonn,more
%O A338327 0,2
%A A338327 _Amiram Eldar_, Oct 22 2020
%E A338327 a(8) from _Bert Dobbelaere_, Oct 29 2020