login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1.
1

%I #28 Feb 08 2024 01:48:58

%S 2,3,7,757,9927299,359243616342953,715785216155101252101551612587517

%N a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1.

%C a(1) = 2, a(n+1) = smallest palindromic prime == 1 (mod a(n)).

%Y Cf. A002385.

%K base,nonn,more

%O 1,1

%A _Amarnath Murthy_, Mar 30 2002

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 31 2003

%E a(6) from _Patrick De Geest_, Jun 10 2003

%E a(7) from _Max Alekseyev_, Feb 06 2024