login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175692 a(n) is the smallest number such that a(n)*n is an anagram of a(n)*3. 0

%I

%S 1035,1782,1,54,36,41958,45,9,345,351,621,594,63,693,47619,432,495,

%T 462,369,3582,453,35964,33957,37989,36405,349299,363,343224,33382899,0

%N a(n) is the smallest number such that a(n)*n is an anagram of a(n)*3.

%C a(4) = 54 and 54*4 = 216, 54*3 = 162 and 216 is an anagram of 162.

%C a(30) has no possible solution in base 10. - _Robert G. Wilson v_, Aug 15 2010

%t f[n_] := Block[ {k = 1}, While[ Sort@ IntegerDigits[3 k] != Sort@ IntegerDigits[k*n], k++ ]; k]; Array[f, 29] (* _Robert G. Wilson v_, Aug 15 2010 *)

%K base,nonn

%O 1,1

%A _Claudio Meller_, Aug 09 2010

%E More terms from _Robert G. Wilson v_, Aug 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 21:35 EDT 2021. Contains 343808 sequences. (Running on oeis4.)