This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A228017 #26 Sep 27 2021 07:07:56
%S A228017 1,2,3,4,5,6,7,8,9,12,24,36,48
%N A228017 Numbers n divisible by the sum of any k-subset of digits of n with k >= 1.
%C A228017 No additional terms less than 20000000. - _T. D. Noe_, Aug 14 2013
%C A228017 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
%e A228017 48 is here because 48 is divisible by 4, 8, and 4+8.
%t A228017 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 *)
%Y A228017 Subset of A051004 and of A346535.
%K A228017 nonn,base,fini,full
%O A228017 1,2
%A A228017 _Derek Orr_, Aug 02 2013