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 A033862 #16 Feb 16 2025 08:32:36
%S A033862 1,2,3,4,5,6,7,8,9,11,11,12,13,14,15,16,17,18,19,22,33,22,23,24,25,26,
%T A033862 27,28,29,33,44,55,33,34,35,36,37,38,39,44,55,66,77,44,45,46,47,48,49,
%U A033862 55,66,77,88,99,55,56,57,58,59,66,77,88,99,233,233,66,67,68,69,77,88
%N A033862 Sorted number reached from starter n in Sort-then-add sequence, or -1 if never reaches sorted number.
%C A033862 Probably a(316) = -1.
%H A033862 Michael S. Branicky, <a href="/A033862/b033862.txt">Table of n, a(n) for n = 1..315</a>
%H A033862 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Sort-Then-AddSequence.html">Sort-then-Add Sequence</a>.
%o A033862 (Python)
%o A033862 from itertools import islice
%o A033862 def a(n):
%o A033862 while n != (s:=int("".join(sorted(str(n))))): n += s
%o A033862 return s
%o A033862 print([a(n) for n in range(1, 72)]) # _Michael S. Branicky_, Jan 15 2024
%K A033862 nonn,base
%O A033862 1,2
%A A033862 _David W. Wilson_