login
a(1) = 1, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1).
5

%I #37 Sep 21 2019 06:30:16

%S 1,11,101,10301,1003001,100030001,10003630001,1000136310001,

%T 100010363010001,10001036363010001,1000103639363010001,

%U 100010356393653010001,10001033563936533010001,1000103305639365033010001,100010313056393650313010001,10001031305636963650313010001

%N a(1) = 1, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1).

%H Giovanni Resta, <a href="/A082620/b082620.txt">Table of n, a(n) for n = 1..92</a>

%Y Cf. A002385, A082621, A082622, A082623, A082624.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 29 2003

%E Corrected by _R. J. Mathar_, Oct 01 2006

%E a(7)-a(10) from _Felix Fröhlich_, Oct 16 2014

%E a(11)-a(12) from _Felix Fröhlich_, Nov 26 2014

%E a(13)-a(16) from _Felix Fröhlich_, Apr 02 2015

%E Terms a(8)-a(16) corrected by _Giovanni Resta_, Sep 20 2019