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 A243658 #23 Jul 02 2024 10:19:39 %S A243658 0,1,3,6,1,6,12,19,27,36,46,57,69,82,96,111,127,144,162,181,21,42,64, %T A243658 87,111,136,162,189,217,246,276,37,69,12,46,81,117,154,192,231,271, %U A243658 312,354,397,441,486,532,579,627,676,726,777,829,882,936,991,147,24,82,141,21,82,144,27,91,156,222,289 %N A243658 a(0)=0; thereafter a(n) = noz(n+a(n-1)), where noz(n) = A004719(n). %C A243658 Zeroless analog of triangular numbers. %H A243658 N. J. A. Sloane, <a href="/A243658/b243658.txt">Table of n, a(n) for n = 0..5000</a> %p A243658 noz:=proc(n) local a,t1,i,j; a:=0; t1:=convert(n,base,10); for i from 1 to nops(t1) do j:=t1[nops(t1)+1-i]; if j <> 0 then a := 10*a+j; fi; od: a; end; %p A243658 t1:=[0]; for n from 1 to 50 do t1:=[op(t1),noz(n+t1[n])]; od: t1; %t A243658 noz[n_] := FromDigits[DeleteCases[IntegerDigits[n], 0]]; %t A243658 Block[{n = 0}, NestList[noz[++n+#] &, 0, 100]] (* _Paolo Xausa_, Apr 17 2024 *) %o A243658 (Python) %o A243658 from itertools import count, islice %o A243658 def noz(n): return int(str(n).replace("0", "")) %o A243658 def agen(): # generator of terms %o A243658 yield (an:=0) %o A243658 yield from (an:=noz(n+an) for n in count(1)) %o A243658 print(list(islice(agen(), 68))) # _Michael S. Branicky_, Jul 02 2024 %Y A243658 Cf. A004719, A242350, A243063, A243657. %Y A243658 Row n = 3 of A373169. %K A243658 nonn,base,look,hear %O A243658 0,3 %A A243658 _N. J. A. Sloane_, Jun 11 2014