Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)).
A061303
Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)).
Terms
- a(0) =2a(1) =5a(2) =13a(3) =17a(4) =19a(5) =31a(6) =37a(7) =41a(8) =43a(9) =61a(10) =67a(11) =71a(12) =73a(13) =79a(14) =89a(15) =97a(16) =101a(17) =109a(18) =113a(19) =127a(20) =131a(21) =137a(22) =139a(23) =151a(24) =157a(25) =163a(26) =181a(27) =193a(28) =197a(29) =199
External references
- oeis: A061303