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 #9 May 11 2019 18:37:52
%S 1,2,3,0,6,2,11,10,4,7,22,17,22,13,18,36,43,35,42,35,21,28,59,58,42,
%T 51,79,72,83,63,74,81,59,70,82,112,126,102,116,157,173,148,164,154,
%U 146,116,179,186,154,186,153,193,212,216,180,237,200,220,300,287,309,269,324,343,301,329,353,339
%N Sum of n mod m, summed over semiprimes m = 4, 6, 9, ..., smallest semiprime >= n.
%p A173717 := proc(n) a := 0 ; for i from 1 do s := A001358(i) ; a := a + (n mod s) ; if s >= n then return a; end if; end do: end proc: # _R. J. Mathar_, Nov 26 2010
%Y Cf. A106325.
%K nonn,less
%O 1,2
%A _Juri-Stepan Gerasimov_, Nov 25 2010
%E Corrected by _R. J. Mathar_, Nov 26 2010