The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088753 Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome (with the exception of n itself) and does not join the trajectory of any term m < n. 10
 196, 879, 1997, 7059, 9999, 10553, 10563, 10577, 10583, 10585, 10638, 10663, 10668, 10697, 10715, 10728, 10735, 10746, 10748, 10783, 10785, 10787, 10788, 10877, 10883, 10963, 10965, 10969, 10977, 10983, 10985, 12797, 12898, 13097, 13197, 13694, 14096, 14698, 15297, 15597, 18598, 18798 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Although the starting number n is regarded as part of the trajectory, it is allowed to be palindromic. Hence palindromes are not excluded from the sequence. A063048 is obtained if palindromes are excluded. The smallest term in A088753 but not in A063048 is 9999, the smallest term in A063048 but not in A088753 is 19098. W. VanLandingham and others have computed nearly 10^7 terms (all terms < 10^14), cf. W. VanLandingham, 196 and Other Lychrel Numbers. From M. F. Hasler, Apr 13 2019: (Start) Lychrel numbers listed here are also called "seeds", in contrast to Kin numbers A023108 which include all terms in the orbits of the former. It is not easy to determine whether the orbit of a given term will never merge into the orbit of an earlier term. It seems that the property of "disjoint orbit" is as conjectural as the property of not reaching a palindrome. One could specify a "search limit" in order to get a well-defined sequence. The given list of terms has been checked and extended by considering the orbits up to members of size <= 10^199 at least. Given that the number increases by a factor 10 roughly every 2.416 iterations, this corresponds to about 500 iterations. (End) LINKS M. F. Hasler, Table of n, a(n) for n = 1..74 (all terms up to 10^5), Apr 13 2019. W. VanLandingham, 196 and Other Lychrel Numbers [Copy on web.archive.org as of 05/2018, original site p196.org seems no longer available. - M. F. Hasler, Apr 13 2019] EXAMPLE From M. F. Hasler, Apr 13 2019: (Start) All numbers < 196 quickly reach a palindrome under iterations of the reverse-and-add function A056964, cf. A033665. a(1) = 196 is the smallest integer which appears to never reach a palindrome (checked up to 10^9 iterations!). Next, A056964(196) = 196 + 691 = 887 is in the orbit of 196 and will therefore never reach a palindrome if 196 does not. However, we do not list this term in this sequence because it is in the orbit of the smaller term 196. Similarly, 295 + 592 = 887 = A056964(196). Therefore, 295 will also never reach a palindrome if 196 (and therefore 887) doesn't. But again we will not list this number, because its orbit merges into that of the smaller term 196. The next number which appears to be a Lychrel and has an orbit (conjectured to be) disjoint with that of 196 is 897 = a(2). (End) MATHEMATICA limit = 10^3; (* Assumes that there is no palindrome if none is found before "limit" iterations *) utraj = {}; Select[Range[0,   20000], (np = # + IntegerReverse[#];    x = NestWhileList[ # + IntegerReverse[#] &, np, ! PalindromeQ[#] &, 1, limit];    If[Length[x] >= limit  && Intersection[x, utraj] == {},     utraj = Union[utraj, x, {np}]; True, utraj = Union[utraj, x, {np}]]) &] (* Robert Price, Oct 16 2019 *) PROG (PARI) A088753_upto(LIM=2e4, M=1e199)={my(U=[], a=List()); for(n=1, LIM, my(t=n); while( t

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.

Last modified June 26 03:36 EDT 2022. Contains 354871 sequences. (Running on oeis4.)