|
%I #5 Dec 05 2013 19:56:13
%S 101,313,727,919,10301,11311,12421,13331,14341,15451,16061,17471,
%T 18181,19391,30103,31013,32323,33533,34543,35053,36263,37273,38083,
%U 39293,70207,71317,72227,73037,74047,75557,76367,77377,78487,79397,90709
%N 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 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 Answer to question: A082768(37) = 92, a(37) = 9200029. - _David Wasserman_, Jul 28 2005
%Y Cf. A082768, A082769.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Apr 18 2003
%E More terms from _David Wasserman_, Jul 28 2005
|
