|
%I #9 Mar 31 2017 21:39:19
%S 1,2,3,22,5,32,7,222,33,52,11,322,13,72,53,2222,17,332,19,522,73,112,
%T 23,3222,55,132,333,722,29,532,31,22222,113,172,75,3322,37,192,133,
%U 5222,41,732,43,1122,533,232,47,32222,77,552,173,1322,53,3332,115,7222,193,292
%N Replace n with concatenation of its prime factors in decreasing order.
%H Alois P. Heinz, <a href="/A084796/b084796.txt">Table of n, a(n) for n = 1..20000</a>
%p with(numtheory):
%p a:= n-> parse(cat(`if`(n=1, 1,
%p sort([seq(i[1]$i[2], i=ifactors(n)[2])], `>`)[]))):
%p seq(a(n), n=1..100); # _Alois P. Heinz_, May 02 2016
%t Table[FromDigits[Flatten[Table[#[[1]],#[[2]]]&/@ Reverse[ FactorInteger[ n]]]],{n,60}] (* _Harvey P. Dale_, Aug 29 2016 *)
%Y Cf. A032726, A085307, A084797.
%K nonn,base,easy
%O 1,2
%A _N. J. A. Sloane_, Jul 19 2003
%E More terms from Christopher N. Swanson (cswanson(AT)ashland.edu), Jul 22 2003
|
