cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A088170 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.

This page as a plain text file.
%I A088170 #6 Mar 30 2012 17:27:41
%S A088170 10,12,14,16,18,110,132,143,154,165,176,187,198,1009,1010,1029,1030,
%T A088170 1049,1050,1069,1070,1089,1090,1110,1130,1131,1150,1151,1170,1171,
%U A088170 1190,1191,1211,1212,1231,1232,1251,1252,1271,1272,1291,1292,1312,1313,1332
%N A088170 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 A088170 Subsequence of A067030.
%C A088170 The most significant digit of all terms is 1.
%H A088170 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e A088170 165 is a term since S(165) = {69, 78, 87, 96}.
%Y A088170 Cf. A067030, A088169, A088171.
%K A088170 nonn,base
%O A088170 1,1
%A A088170 _Klaus Brockhaus_, Sep 21 2003