Least k such that 1 < p < n < c < k, where p is a prime and c is a composite number such that for every p there exists a distinct c.
A092996
Least k such that 1 < p < n < c < k, where p is a prime and c is a composite number such that for every p there exists a distinct c.
Terms
- a(0) =3a(1) =5a(2) =9a(3) =9a(4) =11a(5) =11a(6) =15a(7) =16a(8) =17a(9) =17a(10) =21a(11) =21a(12) =23a(13) =25a(14) =26a(15) =26a(16) =28a(17) =28a(18) =31a(19) =33a(20) =34a(21) =34a(22) =36a(23) =37a(24) =39a(25) =40a(26) =41a(27) =41a(28) =45a(29) =45
External references
- oeis: A092996