|
%I #15 Nov 22 2019 02:31:02
%S 0,2,3,4,5,6,7,6,8,10,11,12,13,14,14,16,17,18,19,18,20,22,23,24,24,26,
%T 27,27,29,30,31,30,32,34,34,36,37,38,38,40,41,42,43,42,45,46,47,45,48,
%U 48,50,51,53,52,54,56,56,58,59,60,61,62,63,60,64,66,67,66,68,69,71,70,73,74,75,75,76,78
%N a(n) = the largest multiple of {the sum of the prime-factorization exponents of n} that is <= n.
%H Robert Israel, <a href="/A161658/b161658.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = n - (n mod A001222(n)), n >= 1. - _R. J. Mathar_, Jul 08 2011
%p A161658 := proc(n) if n = 1 then 0; else e := numtheory[bigomega](n) ; n - (n mod e) ; end if; end proc: # _R. J. Mathar_, Jul 08 2011
%Y Cf. A161659.
%K nonn
%O 1,2
%A _Leroy Quet_, Jun 15 2009
|
