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.

A088171 Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty, at least one element of S(n) has the same number of digits as n and at least one element of S(n) has one digit less than n has.

Original entry on oeis.org

121, 1111, 11011, 12221, 110011, 121121, 1100011, 1112111, 1197801, 1208911, 1210121, 1211111, 1222221, 11000011, 11111111, 11988801, 12098911, 12100121, 12101111, 12211221, 110000011, 110121011, 111089011, 111101111, 111111011
Offset: 1

Views

Author

Klaus Brockhaus, Sep 21 2003

Keywords

Comments

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

Examples

			1111 is a term since S(1111) = {209, 308, 407, 506, 605, 704, 803, 902, 1010, 1100}.
		

Crossrefs