* --Originally published at マルコ*

## What to Do

Your job is to create a program that asks the user for two pieces of data:

- The lower bound of the sequence
- The upper bound of the sequence

## Details

- The range of numbers analysed (lower to upper bound)
- The number of natural palindromes (no addition to inverse needed)
- The number of non-Lycherels encountered (become palindromes)
- The number of Lycherel number candidates (that did not converge to palindrome)

Since you will not be able to prove that a number is Lycherel (since you cannot computer forever to check), our definition for a Lycherel candidate will be if a number does not converge after 30 iterations of applying the addition to the inverse.

Featured image:

# 196 Dex