|
%I #14 Apr 09 2023 07:54:25
%S 2,4,6,8,10,18,21,27,36,42,48,54,63,72,81,90,102,110,112,117,126,133,
%T 140,150,153,162,180,192,198,201,207,210,220,224,228,234,243,252,264,
%U 270,285,300,308,315,322,330,336,351,364,372,378,396,400,405,408,414
%N Bisection of A005349.
%H G. C. Greubel, <a href="/A100433/b100433.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A005349(2*n). - _G. C. Greubel_, Apr 09 2023
%p 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],j=1..58); # _Emeric Deutsch_, Dec 16 2004
%t Select[Range[1000], Divisible[#, Total[IntegerDigits[#]]] &][[2;; ;; 2]] (* _G. C. Greubel_, Apr 09 2023 *)
%o (Magma)
%o A005349:=[n: n in [1..10000] | n mod &+Intseq(n) eq 0];
%o A100433:= func< n | A005349[2*n] >;
%o [A100433(n): n in [1..150]]; // _G. C. Greubel_, Apr 09 2023
%o (SageMath)
%o A005349=[n for n in (1..10^4) if sum(n.digits(base=10)).divides(n)]
%o def A100433(n): return A005349[2*n-1]
%o [A100433(n) for n in range(1,151)] # _G. C. Greubel_, Apr 09 2023
%Y Cf. A005349.
%K nonn,easy,base
%O 1,1
%A _N. J. A. Sloane_, Nov 20 2004
%E More terms from _Emeric Deutsch_, Dec 16 2004
|
