login
A292859
Numbers n such that 10 applications of 'Reverse and Subtract' lead to n, whereas fewer than 10 applications do not lead to n.
10
101451293600894707746789, 105292253210898548706399, 245973964471725640521348, 274359478651754026035528, 551171141805402848917944, 597151082055448828858194
OFFSET
1,1
COMMENTS
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.
LINKS
J. H. E. Cohn, Palindromic differences, Fibonacci Quart. 28 (1990), no. 2, 113-120.
FORMULA
n = f^10(n), n <> f^k(n) for k < 10, where f: x -> |x - reverse(x)|.
EXAMPLE
105292253210898548706399 -> 888315592687113803586102 -> 686630284375327508072214 -> 274359478651754026035528 -> 551171141805402848917944 -> 101451293600894707746789 -> 886196413897111684407312 -> 672491927785313369715624 -> 245973964471725640521348 -> 597151082055448828858194 -> 105292253210898548706399
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Terms ordered by Ray Chandler, Sep 27 2017
STATUS
approved