A023109 - cp's OEIS frontend

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.

n	a(n)
0	0
1	10
2	19
3	59
4	69
5	166
6	79
7	188
8	193
9	1397
10	829
11	167
12	2069
13	1797
14	849
15	177
16	1496
17	739
18	1798
19	10777
20	6999
21	1297
22	869
23	187
24	89
25	10797
26	10853
27	10921
28	10971
29	13297
30	10548
31	13293
32	17793
33	20889
34	700269
35	106977
36	108933
37	80359
38	13697
39	10794
40	15891
41	1009227
42	1007619
43	1009246
44	1008628
45	600259
46	131996
47	70759
48	1007377
49	1001699
50	600279
51	141996
52	70269
53	10677
54	10833
55	10911

[0, 10, 19, 59, 69, 166, 79, 188, 193, 1397, 829, 167, 2069, 1797, 849, 177, 1496, 739, 1798, 10777, 6999, 1297, 869, 187, 89, 10797, 10853, 10921, 10971, 13297, 10548, 13293, 17793, 20889, 700269, 106977, 108933, 80359, 13697, 10794, 15891, 1009227, 1007619, 1009246, 1008628, 600259, 131996, 70759, 1007377, 1001699, 600279, 141996, 70269, 10677, 10833, 10911]

cp's OEIS Frontend

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.

Table of values

List of values