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!)
A248210 Zeroless numbers k (numbers in A052382) such that k - DigitProduct(k) contains the same distinct digits as k. 1

%I #39 May 06 2022 13:13:51

%S 293,362,436,545,554,631,653,749,763,891,958,965,1293,1362,1436,1545,

%T 1554,1631,1653,1749,1763,1891,1958,1965,2193,2331,2491,2536,2556,

%U 2565,2693,2917,2954,2963,3162,3231,3325,3382,3529,3534,3635,3651,4291,4515,4533,4551,4634,4935,4952,4971

%N Zeroless numbers k (numbers in A052382) such that k - DigitProduct(k) contains the same distinct digits as k.

%C Numbers that contain zeros trivially have this property. - _Tanya Khovanova_, Jul 19 2021

%e 631 - 6*3*1 = 613 contains the same digits as 631. So 631 is a term of this sequence.

%t Select[Range@5000,(d=IntegerDigits@#;FreeQ[d,0]&&Union@IntegerDigits[#-Times@@d]==Union@d)&] (* _Giorgos Kalogeropoulos_, Jul 20 2021 *)

%o (PARI)

%o for(n=1, 10^4, d=digits(n); p=prod(i=1, #d, d[i]); if(p && vecsort(digits(n), , 8)==vecsort(digits(n-p), , 8), print1(n, ", ")))

%o (Python)

%o from math import prod

%o def ok(n):

%o s = str(n)

%o return '0' not in s and set(str(n-prod(int(d) for d in s))) == set(s)

%o print(list(filter(ok, range(5000)))) # _Michael S. Branicky_, Jul 18 2021

%Y Cf. A052382 (zeroless numbers), A007954 (digit product).

%Y Cf. A247888 (similar, with n + digit product).

%K nonn,easy,base

%O 1,1

%A _Derek Orr_, Oct 03 2014

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 27 20:19 EDT 2024. Contains 372020 sequences. (Running on oeis4.)