|
|
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
|
|
|
|
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
|
|
|
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
|
|
CROSSREFS
|
Cf. A072142, A072143, A072718, A072719, A215669, A292634, A292635, A292846, A292856, A292857, A292858.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|