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 A336176 #9 Jul 18 2020 04:33:04 %S A336176 2,8,10,15,16,18,19,20,28,29,37,39,41,42,45,48,50,51,52,53,56,57,59, %T A336176 63,65,74,76,77,78,79,83,84,87,89,90,92,94,100,101,102,107,113,114, %U A336176 115,116,117,118,119,121,122,126,127,130,134,138,141,144,146,147,148 %N A336176 Numbers k such that there is a single powerful number between k^2 and (k+1)^2. %C A336176 Positions of 1's in A119241. %C A336176 Shiu (1980) proved that this sequence has an asymptotic density 0.3955... A more accurate calculation using his formula gives 0.3955652153962362... %C A336176 1 is the most common value of A119241. %D A336176 József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, chapter VI, p. 226. %H A336176 Amiram Eldar, <a href="/A336176/b336176.txt">Table of n, a(n) for n = 1..10000</a> %H A336176 P. Shiu, <a href="https://doi.org/10.1112/S0025579300010056">On the number of square-full integers between successive squares</a>, Mathematika, Vol. 27, No. 2 (1980), pp. 171-178. %e A336176 2 is a term since there is a single powerful number, 8 = 2^3, between 2^2 = 4 and (2+1)^2 = 9. %t A336176 powQ[n_] := (n == 1) || Min @@ FactorInteger[n][[;; , 2]] > 1; Select[Range[150], Count[Range[#^2 + 1, (# + 1)^2 - 1], _?powQ] == 1 &] %Y A336176 Cf. A001694, A119241, A119242, A336175, A336177, A336178. %K A336176 nonn %O A336176 1,1 %A A336176 _Amiram Eldar_, Jul 10 2020