login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(1) = 3; for n > 1, a(n) is the smallest palindromic prime containing exactly 3 more digits on each end than a(n-1), with a(n-1) as a central substring.
1

%I #14 Sep 19 2024 21:47:56

%S 3,1003001,1021003001201,1211021003001201121,

%T 1251211021003001201121521,1211251211021003001201121521121,

%U 1041211251211021003001201121521121401,1081041211251211021003001201121521121401801,1091081041211251211021003001201121521121401801901

%N a(1) = 3; for n > 1, a(n) is the smallest palindromic prime containing exactly 3 more digits on each end than a(n-1), with a(n-1) as a central substring.

%C There are 27 terms in this sequence.

%H Shyam Sunder Gupta, <a href="/A376130/b376130.txt">Table of n, a(n) for n = 1..27</a>

%Y Cf. A047076, A053600, A375690, A052205.

%K base,nonn,fini,full

%O 1,1

%A _Shyam Sunder Gupta_, Sep 11 2024