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 A074796 #26 Feb 02 2025 02:12:52
%S A074796 0,1,2,2,3,3,4,4,4,4,5,5,6,6,6,7,8,8,9,9,9,9,10,11,11,11,11,11,12,13,
%T A074796 14,14,14,14,14,14,15,15,15,16,17,18,19,19,19,19,20,20,20,20,20,20,21,
%U A074796 22,22,23,23,23,24,24,25,25,25,25,25,26,27,27,27,28,29,29,30,30,30,30
%N A074796 Number of numbers k <= n such that tau(k) == 2 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.
%H A074796 Amiram Eldar, <a href="/A074796/b074796.txt">Table of n, a(n) for n = 1..10000</a>
%F A074796 a(n) is asymptotic to c*n with c = 0.38....
%F A074796 The constant is conjecturally 3*zeta(3)/Pi^2 = 0.3653814847007... (A346602). See A211338 for more details. - _Amiram Eldar_, Feb 01 2025
%t A074796 Accumulate[Table[If[Mod[DivisorSigma[0,n],3]==2,1,0],{n,80}]] (* _Harvey P. Dale_, Apr 22 2018 *)
%o A074796 (PARI) a(n)=sum(k=1,n,if(numdiv(k)%3-2,0,1))
%Y A074796 Cf. A000005, A074794, A074795, A211338, A346602.
%K A074796 nonn
%O A074796 1,3
%A A074796 _Benoit Cloitre_, Sep 07 2002