The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A306788 Numbers k such that all digits in k are different and for each digit d it is true that k = d (mod sum of digits(k) - d). 0
287, 375, 485, 643, 735, 739, 827, 1276, 1453, 2531, 2537, 3187, 3251, 3540, 5413, 5783, 6138, 6315, 6571, 9381, 9817, 14053, 20176, 23961, 30618, 47908, 63015, 69324, 71842, 78142, 91826, 92361, 98301, 415826, 415829, 693024, 910824, 5481029 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The sequence is complete.
LINKS
EXAMPLE
287 is in the sequence, because 287 = 7 (mod 2 + 8), 287 = 8 (mod 2 + 7) and 287 = 2 (mod 8 + 7).
MATHEMATICA
Select[Range[10^7], Function[{n, d, s}, And[Length@ Union@ d == IntegerLength@ n, AllTrue[d, If[# == 0, 0, Mod[n, #]] &[s - #] == # &]]] @@ {#1, #2, Total@ #2} & @@ {#, IntegerDigits@ #} &] (* Michael De Vlieger, Mar 11 2019 *)
CROSSREFS
Intersection of A010784 and A172189. - Michel Marcus, Mar 12 2019
Sequence in context: A140926 A295447 A203049 * A259402 A157997 A063362
KEYWORD
nonn,base,fini,full
AUTHOR
Daniel Starodubtsev, Mar 10 2019
STATUS
approved

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 May 21 19:35 EDT 2024. Contains 372738 sequences. (Running on oeis4.)