cp's OEIS Frontend

A209870 Numbers n for which tau(n) = tau(n'), where tau is the number of divisors of n and n' the arithmetic derivative of n.

%I A209870 #11 Jun 18 2017 02:00:50
%S A209870 4,15,21,26,27,28,33,38,48,50,57,62,69,72,74,80,85,93,99,106,129,133,
%T A209870 134,145,156,166,176,177,178,200,205,207,213,217,218,226,237,249,253,
%U A209870 254,262,265,276,278,308,309,314,348,362,364,368,380,393,398,410,417
%N A209870 Numbers n for which tau(n) = tau(n'), where tau is the number of divisors of n and n' the arithmetic derivative of n.
%H A209870 Paolo P. Lava, <a href="/A209870/b209870.txt">Table of n, a(n) for n = 1..1000</a>
%e A209870 Divisors of 26 are four: 1, 2, 13 and 26. Arithmetic derivative of 26 is 15 and its divisors are four: 1, 3, 5 and 15.
%p A209870 with(numtheory);
%p A209870 A209870:=proc(n)
%p A209870 local a,i,p,pfs;
%p A209870 for i from 1 to n do
%p A209870   pfs:=ifactors(i)[2]; a:=i*add(op(2,p)/op(1,p),p=pfs);
%p A209870   if tau(a)=tau(i) then print(i); fi;
%p A209870 od; end:
%p A209870 A209870(1000);
%Y A209870 Cf. A000005, A003415, A190402, A190403
%K A209870 nonn,easy
%O A209870 1,1
%A A209870 _Paolo P. Lava_, Mar 15 2012