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 A345391 #8 Jun 21 2021 03:05:30 %S A345391 11,22,33,44,55,66,77,88,99,100,1111,1212,1131,1414,1155,1616,1717, %T A345391 1188,1919,200,2121,2222,322,2424,225,2262,2727,2828,2929,300,1333, %U A345391 3232,3333,3434,3535,3636,3737,3838,3393,400,4141,4242,344,4444,4455,644,4747 %N A345391 a(n) is the least proper multiple of n with the same set of decimal digits as n. %H A345391 Rémy Sigrist, <a href="/A345391/b345391.txt">Table of n, a(n) for n = 1..10000</a> %F A345391 a(n) <= A020338(n) for any n > 0. %o A345391 (PARI) a(n) = { my (d=Set(digits(n))); forstep (m=2*n, oo, n, if (Set(digits(m))==d, return (m))) } %o A345391 (Python) %o A345391 def a(n): %o A345391 kn, ss = 2*n, set(str(n)) %o A345391 while set(str(kn)) != ss: kn += n %o A345391 return kn %o A345391 print([a(n) for n in range(1, 49)]) # _Michael S. Branicky_, Jun 17 2021 %Y A345391 Cf. A020338, A029793, A276769. %K A345391 nonn,base,easy %O A345391 1,1 %A A345391 _Rémy Sigrist_, Jun 17 2021