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.
%I A082770 #5 Dec 05 2013 19:56:13 %S A082770 101,313,727,919,10301,11311,12421,13331,14341,15451,16061,17471, %T A082770 18181,19391,30103,31013,32323,33533,34543,35053,36263,37273,38083, %U A082770 39293,70207,71317,72227,73037,74047,75557,76367,77377,78487,79397,90709 %N A082770 a(n) = smallest palindromic prime that begins with A082768(n) and contains more than twice the number of digits in A082768(n), or 0 if no such number exists. %C A082770 Conjecture: no entry is zero. In most cases the number of digits required is 2k+1 where k is the number of digits in A082768(n). What is the first entry that requires more (than 2k+1) digits? %C A082770 Answer to question: A082768(37) = 92, a(37) = 9200029. - _David Wasserman_, Jul 28 2005 %Y A082770 Cf. A082768, A082769. %K A082770 base,nonn %O A082770 1,1 %A A082770 _Amarnath Murthy_, Apr 18 2003 %E A082770 More terms from _David Wasserman_, Jul 28 2005