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.

Original entry on oeis.org

10, 12, 14, 16, 18, 110, 132, 143, 154, 165, 176, 187, 198, 1009, 1010, 1029, 1030, 1049, 1050, 1069, 1070, 1089, 1090, 1110, 1130, 1131, 1150, 1151, 1170, 1171, 1190, 1191, 1211, 1212, 1231, 1232, 1251, 1252, 1271, 1272, 1291, 1292, 1312, 1313, 1332
Offset: 1

Views

Author

Klaus Brockhaus, Sep 21 2003

Keywords

Comments

Subsequence of A067030.
The most significant digit of all terms is 1.

Examples

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

Crossrefs