|
%I #27 Jul 08 2017 19:34:58
%S 1,2,3,4,5,6,7,8,9,10,11,12,31,14,15,16,71,18,91,20,21,22,32,24,25,62,
%T 27,28,92,30,13,32,33,142,35,36,73,182,93,40,14,42,34,44,45,64,74,48,
%U 49,50,213,124,35,54,55,56,273,184,95,60,16,26,63,64,155,66,76,284,96,70,17,72
%N In prime factorization of n replace each prime with its reversal (in decimal notation).
%C The range of A007500 is a subset of the range of this sequence. - _Reinhard Zumkeller_, Jul 06 2009
%C a(A000040(n)) = A004087(n).
%C Prime factors counted with multiplicity. - _Harvey P. Dale_, Jul 08 2017
%H N. J. A. Sloane, <a href="/A071786/b071786.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%F completely multiplicative with a(p) = A004086(p), p prime.
%e a(143) = a(11*13) = a(11)*a(13) = 11*31 = 341.
%p read("transforms") ; A071786 := proc(n) local ifs, a, d ; ifs := ifactors(n)[2] ; a := 1 ; for d in ifs do a := a*digrev(op(1, d))^op(2, d) ; od: a ; end: # _R. J. Mathar_, Jun 16 2009
%p # second Maple program:
%p r:= n-> (s-> parse(cat(seq(s[-i], i=1..length(s)))))(""||n):
%p a:= n-> mul(r(i[1])^i[2], i=ifactors(n)[2]):
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jun 19 2017
%t Table[Times@@IntegerReverse/@Flatten[Table[#[[1]],#[[2]]]&/@ FactorInteger[ n]],{n,80}] (* _Harvey P. Dale_, Jul 08 2017 *)
%o (Haskell)
%o a071786 = product . map a004086 . a027746_row
%o -- _Reinhard Zumkeller_, Oct 14 2011
%o (Python3)
%o from sympy import factorint
%o from operator import mul
%o from functools import reduce
%o def A071786(n):
%o ....return 1 if n==1 else reduce(mul,(int(str(p)[::-1])**e for p,e in factorint(n).items())) # _Chai Wah Wu_, Aug 14 2014
%o (PARI) rev(n)=fromdigits(Vecrev(digits(n)))
%o a(n)=my(f=factor(n)); prod(i=1,#f~,rev(f[i,1])^f[i,2]) \\ _Charles R Greathouse IV_, Jun 28 2015
%Y Cf. A151764, A161594, A151765. For records see A151766, A151767.
%Y Cf. A151768 (complement).
%Y Cf. A027746.
%K nonn,base,mult,look
%O 1,2
%A _Reinhard Zumkeller_, Jun 06 2002
|
