a(n) = smallest prime == 1 (mod P(n)) where P(n) is the n-th Palindrome.

A087386

a(n) = smallest prime == 1 (mod P(n)) where P(n) is the n-th Palindrome.

Terms

    a(0) =2a(1) =3a(2) =7a(3) =5a(4) =11a(5) =7a(6) =29a(7) =17a(8) =19a(9) =23a(10) =23a(11) =67a(12) =89a(13) =331a(14) =67a(15) =463a(16) =89a(17) =199a(18) =607a(19) =223a(20) =727a(21) =263a(22) =283a(23) =907a(24) =967a(25) =2053a(26) =1087a(27) =383a(28) =607a(29) =1061

External references