Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jan 09 2022 17:10:21
%S 1,3,1,4,3,3,2,6,1,6,3,4,2,6,3,7,3,3,2,9,2,6,3,6,4,6,1,8,3,6,2,9,3,6,
%T 6,4,2,6,2,12,3,6,2,9,3,6,3,7,3,9,3,8,3,3,6,12,2,6,3,9,2,6,2,10,6,6,2,
%U 9,3,12,3,6,2,6,4,8,6,6,2,15,1,6,3,8,6,6,3,12,3,6,4,9,2,6,6,9,2,9,3,13,3,6
%N a(n) = Sum_{d|n} (d mod 3).
%C The old entry with this sequence number was a duplicate of A070940.
%t Table[Total[Mod[Divisors[n],3]],{n,110}] (* _Harvey P. Dale_, Jan 01 2019 *)
%t Table[DivisorSum[n,Mod[#,3]&],{n,110}] (* _Harvey P. Dale_, Jan 09 2022 *)
%Y Cf. A004016, A093061.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Nov 02 2008