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 A100432 #14 Apr 10 2023 14:06:00 %S A100432 1,3,5,7,9,12,20,24,30,40,45,50,60,70,80,84,100,108,111,114,120,132, %T A100432 135,144,152,156,171,190,195,200,204,209,216,222,225,230,240,247,261, %U A100432 266,280,288,306,312,320,324,333,342,360,370,375,392,399,402,407,410,420 %N A100432 Bisection of A005349. %H A100432 G. C. Greubel, <a href="/A100432/b100432.txt">Table of n, a(n) for n = 1..10000</a> %F A100432 a(n) = A005349(2*n-1). - _G. C. Greubel_, Apr 09 2023 %p A100432 s:=proc(n) local N:N:=convert(n,base,10):sum(N[j],j=1..nops(N)) end:p:=proc(n) if floor(n/s(n))=n/s(n) then n else fi end: A:=[seq(p(n),n=1..440)]: seq(A[2*j-1],j=1..58); # _Emeric Deutsch_, Dec 16 2004 %t A100432 Select[Range[1000], Divisible[#, Total[IntegerDigits[#]]] &][[1;; ;; 2]] (* _G. C. Greubel_, Apr 09 2023 *) %o A100432 (Magma) %o A100432 A005349:=[n: n in [1..10000] | n mod &+Intseq(n) eq 0]; %o A100432 A100432:= func< n | A005349[2*n-1] >; %o A100432 [A100432(n): n in [1..150]]; // _G. C. Greubel_, Apr 09 2023 %o A100432 (SageMath) %o A100432 A005349=[n for n in (1..10^4) if sum(n.digits(base=10)).divides(n)] %o A100432 def A100432(n): return A005349[2*n-2] %o A100432 [A100432(n) for n in range(1, 151)] # _G. C. Greubel_, Apr 09 2023 %Y A100432 Cf. A005349, A100433. %K A100432 nonn,easy,base %O A100432 1,2 %A A100432 _N. J. A. Sloane_, Nov 20 2004 %E A100432 More terms from _Emeric Deutsch_, Dec 16 2004