|
|
A228017
|
|
Numbers n divisible by the sum of any k-subset of digits of n with k >= 1.
|
|
0
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 24, 36, 48
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
No additional terms less than 20000000. - T. D. Noe, Aug 14 2013
Terms > 9 must be even since any pair of digits has an even subset. Since terms must also be zeroless, they cannot be divisible by 5, which means no further terms could have 5 or more digits by the Pigeonhole Principle. Therefore, this sequence is complete. - Charlie Neder, May 31 2019
|
|
LINKS
|
|
|
EXAMPLE
|
48 is here because 48 is divisible by 4, 8, and 4+8.
|
|
MATHEMATICA
|
okQ[n_] := Module[{s = Total /@ Rest[Subsets[IntegerDigits[n]]]}, ! MemberQ[s, 0] && And @@ IntegerQ /@ (n/s)]; Select[Range[10000], okQ] (* T. D. Noe, Aug 14 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|