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 A222533 #12 Feb 16 2025 08:33:19
%S A222533 1,5,77,181,747,88,494,292,4664,9779,464,10901,4884,1991,474,999,838,
%T A222533 64946,989,448844,48084,99199,484,73137,48184,94149,11911,390093,
%U A222533 46264,567765,26262,28782,3541453,831138,1447441,493394,1309031,46664,8817188,17871
%N A222533 Smallest palindrome which requires at least n iterations of Reverse and Add to reach a palindrome.
%C A222533 Palindromes themselves are also 'Reverse and Add!'ed!
%H A222533 Arkadiusz Wesolowski, <a href="/A222533/b222533.txt">Table of n, a(n) for n = 1..110</a>
%H A222533 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Reverse-Then-AddSequence.html">Reverse-Then-Add Sequence</a>
%H A222533 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%H A222533 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t A222533 lst = {}; rev[n_] := FromDigits@Reverse@IntegerDigits[n]; testQ[n_] := ! rev[n] == n; Do[n = 1; While[True, If[! testQ[n], p = n + rev[n]; If[Length@TakeWhile[NestList[# + rev[#] &, p, s - 1], testQ] == s - 1, AppendTo[lst, n]; Break[]]]; n++], {s, 40}]; lst
%Y A222533 Cf. A016016, A033665.
%K A222533 base,nonn
%O A222533 1,2
%A A222533 _Arkadiusz Wesolowski_, Feb 24 2013