|
|
A248040
|
|
Numbers n such that n*digsum(n) contains the same distinct digits as n.
|
|
1
|
|
|
1, 10, 100, 109, 190, 208, 280, 307, 370, 406, 450, 460, 505, 550, 604, 640, 703, 730, 802, 820, 901, 910, 1000, 1009, 1018, 1027, 1036, 1045, 1054, 1063, 1072, 1081, 1090, 1108, 1168, 1180, 1207, 1270, 1286, 1306, 1360, 1405, 1450, 1504, 1540, 1603, 1630, 1702, 1720, 1726, 1801
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
10^k is a subsequence for k >= 0. Thus this sequence is infinite.
|
|
LINKS
|
|
|
MAPLE
|
filter:= proc(n) local L, s, d;
L:= convert(n, base, 10);
d:= convert(L, set);
s:= convert(L, `+`);
evalb(convert(convert(n*s, base, 10), set)=d)
end proc:
|
|
PROG
|
(PARI) for(n=1, 10^4, d=digits(n); if(vecsort(d, , 8)==vecsort(digits(n*sumdigits(n)), , 8), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A247888 (similar, with n + product of digits), A247887 (similar, with n + digsum).
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|