cp's OEIS Frontend

A283742 Numbers with digit sum 11 that are multiples of 11.

%I A283742 #24 Mar 19 2017 19:51:42
%S A283742 209,308,407,506,605,704,803,902,2090,3080,4070,5060,6050,7040,8030,
%T A283742 9020,10109,10208,10307,10406,10505,10604,10703,10802,10901,20009,
%U A283742 20108,20207,20306,20405,20504,20603,20702,20801,20900,30008,30107,30206,30305,30404
%N A283742 Numbers with digit sum 11 that are multiples of 11.
%C A283742 Subsequence of A166311.
%C A283742 Numbers with digit sum 11 and even-numbered digits all 0. - _Robert Israel_, Mar 16 2017
%C A283742 Intersection of A008593 and A166311. - _Michel Marcus_, Mar 17 2017
%C A283742 If m is a term, so is 10*m. - _Zak Seidov_, Mar 17 2017
%H A283742 Robert Israel, <a href="/A283742/b283742.txt">Table of n, a(n) for n = 1..10000</a>
%e A283742 a(1) = A166311(18) = 209 = 19*11,
%e A283742 a(40) = A166311(9881) = 30404 = 2764*11.
%p A283742 F:= proc(d,t) option remember;
%p A283742 if d <= 1 then
%p A283742   if t <= 9 then return [t*10^d] else return [] fi;
%p A283742 fi;
%p A283742 [seq(seq(j*10^d+s, s = procname(d-2, t-j)), j=0..min(9, t))]
%p A283742 end proc:
%p A283742 sort([op(F(4,11)),op(F(5,11))]); # _Robert Israel_, Mar 16 2017
%t A283742 Reap[Do[If[11==Total[IntegerDigits[m=11*k]],Sow[m]],{k,3000}]][[2,1]]
%t A283742 Select[Range[209,30404,11],11==Total[IntegerDigits[#]]&]
%Y A283742 Cf. A008593 (multiples of 11), A166311 (numbers with digit sum 11).
%K A283742 nonn,base
%O A283742 1,1
%A A283742 _Zak Seidov_, Mar 15 2017