login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133220 a(n) is the smallest positive number k such that k and n*k are anagrams. 0

%I #4 Mar 30 2012 18:49:09

%S 1,125874,1035,1782,142857,1386,1359,113967,1089

%N a(n) is the smallest positive number k such that k and n*k are anagrams.

%e 3*1035 = 3105 and this is the smallest such number.

%t Table[Select[Range[1000000], Sort[IntegerDigits[ # ]] == Sort[IntegerDigits[n# ]] &][[1]], {n, 9}]

%Y Cf. A023086, A023087, A023088, A023089, A023090, A023091, A023092, A023093.

%K base,fini,full,nonn

%O 1,2

%A _Tanya Khovanova_, Oct 11 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)