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 A292635 #19 Jan 05 2025 19:51:41 %S A292635 10591266563195008940873343680499,27547681086656717245231891334328, %T A292635 54795638726597554520436127340244,68723845538328853127615446167114, %U A292635 88817367774609971118263222539002 %N A292635 Numbers n such that 5 applications of "Reverse and Subtract" lead to n, whereas fewer than 5 applications do not lead to n. %C A292635 There are 5 thirty-two-digit terms in the sequence. Further sequences can be obtained by inserting at the center of these terms any number of 9's and by concatenating a term any number of times with itself and inserting an equal number of 0's at all junctures. %H A292635 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 A292635 n = f^5(n), n <> f^k(n) for k < 5, where f: x -> |x - reverse(x)|. %e A292635 10591266563195008940873343680499 -> 88817367774609971118263222539002 -> 68723845538328853127615446167114 -> 27547681086656717245231891334328 -> 54795638726597554520436127340244 -> 10591266563195008940873343680499 %Y A292635 Cf. A072142, A072143, A072718, A072719, A215669, A292634, A292846, A292856, A292857, A292858, A292859. %K A292635 nonn,base,more %O A292635 1,1 %A A292635 _Meritxell Vila Miñana_, Sep 20 2017 %E A292635 Terms ordered by _Ray Chandler_, Sep 27 2017