

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.


4



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, 14, 14, 14, 14, 14, 14, 15, 15, 15, 16, 17, 18, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 25, 25, 25, 26, 27, 27, 27, 28, 29, 29, 30, 30, 30, 30
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS



FORMULA

a(n) is asymptotic to c*n with c = 0.38....


MATHEMATICA

Accumulate[Table[If[Mod[DivisorSigma[0, n], 3]==2, 1, 0], {n, 80}]] (* Harvey P. Dale, Apr 22 2018 *)


PROG

(PARI) a(n)=sum(k=1, n, if(numdiv(k)%32, 0, 1))


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



