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 A063049 #17 Apr 17 2023 01:52:53
%S A063049 295,394,493,592,689,691,788,790,887,986,1495,1585,1675,1765,1855,
%T A063049 1945,2494,2584,2674,2764,2854,2944,3493,3583,3673,3763,3853,3943,
%U A063049 4079,4169,4259,4349,4439,4492,4529,4582,4619,4672,4709,4762,4799,4852,4889,4942
%N A063049 Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.
%C A063049 Subsequence of A023108.
%D A063049 Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975), page PC30-9. Gives initial terms of this sequence.
%H A063049 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e A063049 The trajectory of 394 reaches 887 in one step and 887 is a term in the trajectory of 196, so 394 belongs to the present sequence. The corresponding term in A063050, giving the number of steps, accordingly is 1.
%t A063049 Block[{nn = 10^2, s}, s = NestList[# + IntegerReverse@ # &, 196, nn]; Rest@ Select[Range@ 5000, Length@NestWhileList[# + IntegerReverse@ # &, #, FreeQ[s, #] &, 1, nn] <= nn &]] (* _Michael De Vlieger_, Jan 21 2018 *)
%Y A063049 Cf. A033865, A023108, A006960, A063050.
%K A063049 base,nonn
%O A063049 1,1
%A A063049 _Klaus Brockhaus_, Jul 07 2001
%E A063049 Offset corrected by _Sean A. Irvine_, Apr 17 2023