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.

A100772 a(1) = 1; for n>1, a(n+1) is the least number such that there are a(n) palindromes between a(n) and a(n+1) with both ends excluded.

This page as a plain text file.
%I A100772 #13 Jan 28 2020 16:13:24
%S A100772 1,3,7,56,617,58886,495747595,39580716961708594,
%T A100772 295807174575157636751575471708593,
%U A100772 19580717457515767633229292922435653422929292233676751575471708592
%N A100772 a(1) = 1; for n>1, a(n+1) is the least number such that there are a(n) palindromes between a(n) and a(n+1) with both ends excluded.
%H A100772 Andrew Howroyd, <a href="/A100772/b100772.txt">Table of n, a(n) for n = 1..14</a>
%e A100772 a(3)= 7, a(4) = 56 as there are 7 palindromes between 7 and 56: (8,9,11,22,33,44,55).
%t A100772 Nest[Append[#, Block[{k = 0}, Catch@ Do[Which[k == #[[-1]], Throw[i]; Break[], PalindromeQ@ i, k++, True, Nothing], {i, #[[-1]] + 1, Infinity}]]] &, {1}, 5] (* _Michael De Vlieger_, Jan 28 2020 *)
%o A100772 (PARI) \\ Requires A002113.
%o A100772 a(n)={my(k=1, t=0); for(i=1, n, t=1+A002113(k); k += t + (t<10)); t} \\ _Andrew Howroyd_, Jan 27 2020
%Y A100772 Cf. A002113 (palindromes in base 10).
%K A100772 base,nonn
%O A100772 1,2
%A A100772 _Amarnath Murthy_, Nov 28 2004
%E A100772 a(5)-a(7) from _Ray Chandler_, Dec 10 2004
%E A100772 a(8) from _Donovan Johnson_, Dec 03 2009
%E A100772 Terms a(9) and beyond from _Andrew Howroyd_, Jan 27 2020