Primes of the form 4k+3 generated recursively: a(1)=3, a(n)= Min{p; p is prime; Mod[p,4]=3; p|4Q^2-1}, where Q is the product of all previous terms in the sequence.
A217759
Primes of the form 4k+3 generated recursively: a(1)=3, a(n)= Min{p; p is prime; Mod[p,4]=3; p|4Q^2-1}, where Q is the product of all previous terms in the sequence.
Terms
- a(0) =3a(1) =7a(2) =43a(3) =19a(4) =6863a(5) =883a(6) =23a(7) =191a(8) =2927a(10) =11a(11) =163a(12) =227a(13) =9127a(14) =59a(15) =31a(16) =71a(17) =131627a(19) =127a(20) =1302443a(21) =4065403a(22) =107a(23) =2591a(24) =21487a(25) =223a(26) =12823a(27) =167a(28) =53720906651a(30) =39827899a(31) =11719a(32) =131
External references
- oeis: A217759