login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

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

%S 121,1111,11011,12221,110011,121121,1100011,1112111,1197801,1208911,

%T 1210121,1211111,1222221,11000011,11111111,11988801,12098911,12100121,

%U 12101111,12211221,110000011,110121011,111089011,111101111,111111011

%N 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.

%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 1111 is a term since S(1111) = {209, 308, 407, 506, 605, 704, 803, 902, 1010, 1100}.

%Y Cf. A067030, A088169, A088170.

%K nonn,base

%O 1,1

%A _Klaus Brockhaus_, Sep 21 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)