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 A292859 #18 Jun 27 2025 17:53:31 %S A292859 101451293600894707746789,105292253210898548706399, %T A292859 245973964471725640521348,274359478651754026035528, %U A292859 551171141805402848917944,597151082055448828858194 %N A292859 Numbers k such that 10 applications of 'Reverse and Subtract' lead to k, whereas fewer than 10 applications do not lead to k. %C A292859 There are 10 twenty-four-digit terms in the sequence. Terms of derived sequences can be obtained either by inserting at the center of their digits any number of 9's or by concatenating a term any number of times with itself and inserting an equal number of 0's at all junctures. %H A292859 Ray Chandler, <a href="/A292859/b292859.txt">Table of n, a(n) for n = 1..10</a> %H A292859 J. H. E. Cohn, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/28-2/cohn.pdf">Palindromic differences</a>, Fibonacci Quart. 28 (1990), no. 2, 113-120. %F A292859 n = f^10(n), n <> f^k(n) for k < 10, where f: x -> |x - reverse(x)|. %e A292859 105292253210898548706399 -> 888315592687113803586102 -> 686630284375327508072214 -> 274359478651754026035528 -> 551171141805402848917944 -> 101451293600894707746789 -> 886196413897111684407312 -> 672491927785313369715624 -> 245973964471725640521348 -> 597151082055448828858194 -> 105292253210898548706399 %Y A292859 Cf. A072142, A072143, A072718, A072719, A215669, A292634, A292635, A292846, A292856, A292857, A292858. %K A292859 nonn,base %O A292859 1,1 %A A292859 _Meritxell Vila Miñana_, Sep 25 2017 %E A292859 Terms ordered by _Ray Chandler_, Sep 27 2017