login
Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have one digit less than n has.
2

%I #6 Mar 30 2012 17:27:41

%S 10,12,14,16,18,110,132,143,154,165,176,187,198,1009,1010,1029,1030,

%T 1049,1050,1069,1070,1089,1090,1110,1130,1131,1150,1151,1170,1171,

%U 1190,1191,1211,1212,1231,1232,1251,1252,1271,1272,1291,1292,1312,1313,1332

%N Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have one digit less than n has.

%C Subsequence of A067030.

%C The most significant digit of all terms is 1.

%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>

%e 165 is a term since S(165) = {69, 78, 87, 96}.

%Y Cf. A067030, A088169, A088171.

%K nonn,base

%O 1,1

%A _Klaus Brockhaus_, Sep 21 2003