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 A384508 #23 Jun 30 2025 17:52:34 %S A384508 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 A384508 149,159,169,179,189,190,191,192,193,194,195,196,197,198,199,200,300, %U A384508 400,500,600,700,800,900,910,911,912,913,914,915,916,917,918,919,1000 %N A384508 Nonnegative integers k such that the digits of k include the digits of the digital sum of k as a (not necessarily contiguous) subsequence. %H A384508 Felix Huber, <a href="/A384508/b384508.txt">Table of n, a(n) for n = 1..10000</a> %e A384508 196 is a term because 1 + 9 + 6 = 16 and 1, 6 is a subsequence of 1, 9, 6. %p A384508 A384508:=proc(n) %p A384508 option remember; %p A384508 local k,L; %p A384508 if n=1 then %p A384508 0 %p A384508 else %p A384508 for k from procname(n-1)+1 do %p A384508 L:=convert(k,'base',10); %p A384508 if ArrayTools:-IsSubsequence(convert(add(L),'base',10),L) then %p A384508 return k %p A384508 fi %p A384508 od %p A384508 fi; %p A384508 end proc; %p A384508 seq(A384508(n),n=1..58); %Y A384508 Cf. A052018, A005349, A007953, A046829. %K A384508 nonn,base,easy %O A384508 1,3 %A A384508 _Felix Huber_, Jun 26 2025