This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258373 a(n+1) is the least number not occurring earlier such that concatenation(a(n),a(n+1)) - 1 is a palindrome; a(1)=1. 1
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 102, 202, 203, 303, 304, 404, 405, 505, 506, 606, 607, 707, 708, 808, 809, 909, 910, 20, 103, 302, 204, 403, 305, 504, 406, 605, 507, 706, 608, 807, 709, 908, 810, 19, 92, 30, 104, 402, 205, 503, 306, 604, 407, 705, 508, 806, 609, 907, 710, 18 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS M. F. Hasler, Table of n, a(n) for n = 1..1816 E. Angelini, A palindrome + 1, SeqFan list, July 21, 2015. EXAMPLE The concatenation of the first two terms is 12, and 12 - 1 = 11 is a palindrome, and similar for all subsequent terms: 23 - 1 = 22, 34 - 1 = 33, ... 910 - 1 = 909, 10102 - 1 = 10101, ... 9230 - 1 = 9229 is a palindrome, ... PROG (PARI) {S=[a=1]; for(i=1, 100, print1(a", "); for(k=1, 9e9, Vecrev(d=digits(eval(Str(a, k))-1))==d||next; setsearch(S, k)&&next; S=setunion(S, [a=k]); break))} CROSSREFS Sequence in context: A055649 A111705 A071274 * A250266 A085908 A110304 Adjacent sequences:  A258370 A258371 A258372 * A258374 A258375 A258376 KEYWORD nonn,base,easy AUTHOR Eric Angelini and M. F. Hasler, Jul 23 2015 STATUS approved

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

Last modified December 11 23:44 EST 2019. Contains 329945 sequences. (Running on oeis4.)