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 A033272 #15 Jul 01 2022 05:25:45
%S A033272 1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,2,1,1,2,1,1,1,2,1,3,1,1,2,1,1,2,1,
%T A033272 2,2,1,1,2,1,1,2,1,1,4,1,1,1,2,2,2,1,1,3,2,1,2,1,1,2,1,1,4,1,2,2,1,1,
%U A033272 2,2,1,2,1,1,4,1,2,2,1,1
%N A033272 Number of odd nonprimes dividing n.
%H A033272 G. C. Greubel, <a href="/A033272/b033272.txt">Table of n, a(n) for n = 1..1000</a>
%F A033272 a(n) = A001227(n) - A005087(n). - _Amiram Eldar_, Jul 01 2022
%t A033272 Table[Length[Select[Divisors[n],OddQ[#]&&!PrimeQ[#]&]],{n,80}] (* _Harvey P. Dale_, May 06 2012 *)
%t A033272 a[n_] := DivisorSigma[0, n/2^IntegerExponent[n, 2]] - PrimeNu[n] + If[OddQ[n], 0, 1]; Array[a, 100] (* _Amiram Eldar_, Jul 01 2022 *)
%o A033272 (PARI) a(n) = sumdiv(n, d, (d%2) && !isprime(d)); \\ _Michel Marcus_, May 05 2017
%Y A033272 Cf. A001227 (with odd divisors), A005087, A033273 (with nonprime divisors).
%K A033272 nonn
%O A033272 1,9
%A A033272 _N. J. A. Sloane_