a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.
A023109
a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.
Terms
- a(0) =0a(1) =10a(2) =19a(3) =59a(4) =69a(5) =166a(6) =79a(7) =188a(8) =193a(9) =1397a(10) =829a(11) =167a(12) =2069a(13) =1797a(14) =849a(15) =177a(16) =1496a(17) =739a(18) =1798a(19) =10777a(20) =6999a(21) =1297a(22) =869a(23) =187a(24) =89a(25) =10797a(26) =10853a(27) =10921a(28) =10971a(29) =13297
External references
- oeis: A023109