login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175698 a(n) = smallest positive number such a(n)*n is an anagram of a(n)*9. 1

%I

%S 1089,9,345,324,2439,594,18,297,1,45,198,18,11619,2664,12,27,1188,

%T 13986,423,1557,15,15327,30969,3,16245,1215,115,1476,2871,117,1197,

%U 162,207,18,17289,198,2466,13455,21,1278,1251,231,117,198,15873,12285,14094,144

%N a(n) = smallest positive number such a(n)*n is an anagram of a(n)*9.

%C a(2) = 9 because 2*9 = 18, 9*9 = 81 and 18 is an anagram of 81.

%H Chai Wah Wu, <a href="/A175698/b175698.txt">Table of n, a(n) for n = 1..89</a>

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

%K base,nonn,full,fini

%O 1,1

%A _Claudio Meller_, Aug 09 2010

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

%E Name edited by _Chai Wah Wu_, Dec 21 2016

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

License Agreements, Terms of Use, Privacy Policy .

Last modified October 17 10:50 EDT 2017. Contains 293469 sequences.