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!)
A345391 a(n) is the least proper multiple of n with the same set of decimal digits as n. 2

%I #8 Jun 21 2021 03:05:30

%S 11,22,33,44,55,66,77,88,99,100,1111,1212,1131,1414,1155,1616,1717,

%T 1188,1919,200,2121,2222,322,2424,225,2262,2727,2828,2929,300,1333,

%U 3232,3333,3434,3535,3636,3737,3838,3393,400,4141,4242,344,4444,4455,644,4747

%N a(n) is the least proper multiple of n with the same set of decimal digits as n.

%H Rémy Sigrist, <a href="/A345391/b345391.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) <= A020338(n) for any n > 0.

%o (PARI) a(n) = { my (d=Set(digits(n))); forstep (m=2*n, oo, n, if (Set(digits(m))==d, return (m))) }

%o (Python)

%o def a(n):

%o kn, ss = 2*n, set(str(n))

%o while set(str(kn)) != ss: kn += n

%o return kn

%o print([a(n) for n in range(1, 49)]) # _Michael S. Branicky_, Jun 17 2021

%Y Cf. A020338, A029793, A276769.

%K nonn,base,easy

%O 1,1

%A _Rémy Sigrist_, Jun 17 2021

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 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)