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 A053850 #30 Feb 16 2025 08:32:42
%S A053850 9,25,27,45,49,63,75,81,99,117,121,125,135,147,153,169,171,175,189,
%T A053850 207,225,243,245,261,275,279,289,297,315,325,333,343,351,361,363,369,
%U A053850 375,387,405,423,425,441,459,475,477,495,507,513,525,529,531,539,549,567
%N A053850 Odd numbers divisible by a square > 1.
%C A053850 Odd n such that sum(k=1,n-1,floor(k^3/n)) is different from (1/4)*(n-2)*(n^2-1) (equality holds for n prime as well as for "1" union "A024556" ). - _Benoit Cloitre_, Dec 08 2002
%C A053850 Odd nonsquarefree numbers, odd terms of A013929. - _Zak Seidov_, Aug 16 2006
%C A053850 The asymptotic density of this sequence is 1/2 - 4/Pi^2 = 0.094715... - _Amiram Eldar_, Nov 21 2020
%H A053850 Amiram Eldar, <a href="/A053850/b053850.txt">Table of n, a(n) for n = 1..10000</a>
%H A053850 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeSums.html">Prime Sums</a>.
%t A053850 Select[Range[1, 500, 2], !SquareFreeQ[#] &] (* _Amiram Eldar_, Nov 21 2020 *)
%o A053850 (PARI) lista(nn) = {forstep(n=1, nn, 2, if (! issquarefree(n), print1(n, ", ")));} \\ _Michel Marcus_, Jun 06 2014
%Y A053850 Cf. A078837, A013929, A024556.
%K A053850 easy,nonn
%O A053850 1,1
%A A053850 _Enoch Haga_, Mar 28 2000