|
%I #9 Feb 21 2017 20:15:08
%S 1012,10012,10120,10122,10212,100012,100120,100122,100212,101200,
%T 101220,101222,102120,102122,102212,1000012,1000120,1000122,1000212,
%U 1001200,1001220,1001222,1002120,1002122,1002212,1012000,1012200,1012220,1012222
%N Numbers k such that k and 2k are anagrams of each other in base 3 (k is written here in base 3).
%C If a*10^m + b is a term, where b < 10^(m-1), then so is a*10^k+b for all k > m. - _Robert Israel_, Feb 21 2017
%H Robert Israel, <a href="/A023058/b023058.txt">Table of n, a(n) for n = 1..10000</a>
%p f:= proc(n) local L,M;
%p L:= convert(n,base,3);
%p M:= convert(2*n,base,3);
%p if sort(L) = sort(M) then add(L[i]*10^(i-1),i=1..nops(L)) else NULL fi
%p end proc:
%p map(f, [$1..1000]); # _Robert Israel_, Feb 21 2017
%K nonn,base
%O 1,1
%A _David W. Wilson_
|
