This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A345392 #9 Jun 21 2021 03:05:34 %S A345392 2,11,11,11,11,11,11,11,11,11,10,101,101,87,101,77,101,101,66,101,10, %T A345392 101,101,14,101,9,87,101,101,101,10,43,101,101,101,101,101,101,101,87, %U A345392 10,101,101,8,101,99,14,101,101,101,10,101,101,101,101,101,101,101 %N A345392 a(n) is the least k > 1 such that n and k*n have the same set of decimal digits. %H A345392 Rémy Sigrist, <a href="/A345392/b345392.txt">Table of n, a(n) for n = 0..10000</a> %F A345392 a(n) = A345391(n) / n for any n > 0. %F A345392 a(n) = 2 for any n in A023086. %o A345392 (PARI) a(n) = if (n==0, return (2)); { my (d=Set(digits(n))); forstep (m=2*n, oo, max(1, n), if (Set(digits(m))==d, return (m/n))) } %o A345392 (Python) %o A345392 def a(n): %o A345392 k, ss = 2, set(str(n)) %o A345392 while set(str(k*n)) != ss: k += 1 %o A345392 return k %o A345392 print([a(n) for n in range(58)]) # _Michael S. Branicky_, Jun 17 2021 %Y A345392 Cf. A023086, A345391. %K A345392 nonn,base %O A345392 0,1 %A A345392 _Rémy Sigrist_, Jun 17 2021