cp's OEIS Frontend

A052018 Numbers k with the property that the sum of the digits of k is a substring of k.

%I A052018 #38 Feb 13 2024 06:58:51
%S A052018 0,1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100,109,119,129,139,
%T A052018 149,159,169,179,189,199,200,300,400,500,600,700,800,900,910,911,912,
%U A052018 913,914,915,916,917,918,919,1000,1009,1018,1027,1036,1045,1054,1063
%N A052018 Numbers k with the property that the sum of the digits of k is a substring of k.
%H A052018 Reinhard Zumkeller, <a href="/A052018/b052018.txt">Table of n, a(n) for n = 1..10000</a>
%t A052018 sdssQ[n_]:=Module[{idn=IntegerDigits[n],s,len},s=Total[idn];len= IntegerLength[ s]; MemberQ[Partition[idn,len,1],IntegerDigits[s]]]; Join[{0},Select[Range[1100],sdssQ]] (* _Harvey P. Dale_, Jan 02 2013 *)
%o A052018 (Haskell)
%o A052018 import Data.List (isInfixOf)
%o A052018 a052018 n = a052018_list !! (n-1)
%o A052018 a052018_list = filter f [0..] where
%o A052018    f x = show (a007953 x) `isInfixOf` show x
%o A052018 -- _Reinhard Zumkeller_, Jun 18 2013
%o A052018 (Python)
%o A052018 loop = (str(n) for n in range(399))
%o A052018 print([int(n) for n in loop if str(sum(int(k) for k in n)) in n]) # _Jonathan Frech_, Jun 05 2017
%Y A052018 Cf. A052019, A052020, A052021, A052022, A007953, A005349, A028834.
%Y A052018 Cf. A175688. - _Reinhard Zumkeller_, Aug 15 2010
%Y A052018 Cf. A055642, A004426.
%Y A052018 Cf. A119246, A138166.
%K A052018 nonn,base
%O A052018 1,3
%A A052018 _Patrick De Geest_, Nov 15 1999