cp's OEIS Frontend

A023095 a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).

%I A023095 #12 Mar 20 2017 23:13:07
%S A023095 75,142,315,12,819,84,1035,15,198,2766,9555,56,315,8352,20893,45,950,
%T A023095 22000,819,132,63204,24492,114075,91,2646,938,30015,240,182807,118592,
%U A023095 333795,153,5670,187416,73815,380,623610,176820,5699,231,10406,489808
%N A023095 a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).
%C A023095 2*a(n) is divisible by n-1. - _Robert Israel_, Mar 20 2017
%p A023095 for n from 4 to 100 do
%p A023095   searching:= true:
%p A023095   if n::even then delta:= n-1 else delta:= (n-1)/2 fi;
%p A023095   for d from 1 while searching do
%p A023095     for x from n^(d-1)+delta-1 to floor(n^d/3) by delta while searching do
%p A023095       if sort(convert(x,base,n)) = sort(convert(3*x,base,n)) then
%p A023095         searching:= false; A[n]:= x;
%p A023095       fi
%p A023095 od od od:
%p A023095 seq(A[i],i=4..100); # _Robert Israel_, Mar 20 2017
%t A023095 Table[k = 1; While[! Equal @@ Map[Sort@ IntegerDigits[#, n] &, {k, 3 k}], k++]; k, {n, 4, 45}] (* _Michael De Vlieger_, Mar 20 2017 *)
%K A023095 nonn,base
%O A023095 4,1
%A A023095 _David W. Wilson_