|
%I #26 May 25 2016 10:09:38
%S 0,0,0,0,1,0,2,3,3,0,5,0,5,7,0,0,2,0,2,1,9,0,6,5,11,0,6,0,0,0,2,5,15,
%T 11,6,0,17,7,7,0,6,0,14,1,21,0,4,7,2,11,1,0,10,7,4,13,27,0,0,0,29,11,
%U 4,11,2,0,5,17,0,0,0,0,35,10,7,5,6,0,2,9,39
%N n modulo sopfr(n), where sopfr(n) is the sum of the prime factors of n, with multiplicity.
%C a(A036844(n)) = 0. - _Reinhard Zumkeller_, Jul 21 2014
%H Reinhard Zumkeller, <a href="/A238525/b238525.txt">Table of n, a(n) for n = 2..10000</a>
%F a(n) = n mod A001414(n).
%e a(6) = 1, because 6 mod sopfr(6) = 6 mod 5 = 1.
%t Table[Mod[n, Apply[Dot, Transpose[FactorInteger[n]]]], {n, 105}] (* _Wouter Meeussen_, Mar 01 2014 *)
%t mms[n_]:=Mod[n,Total[Flatten[Table[#[[1]],#[[2]]]&/@FactorInteger[ n]]]]; Array[mms,90,2] (* _Harvey P. Dale_, May 25 2016 *)
%o (Haskell)
%o a238525 n = mod n $ a001414 n -- _Reinhard Zumkeller_, Jul 21 2014
%Y Cf. A001414, A238526, A238527, A238528, A238529, A238530.
%Y Cf. A036844.
%K nonn,easy
%O 2,7
%A _J. Stauduhar_, Feb 28 2014
|
