Least k such that 1 < c < n < p < k, where p is a prime and c is a composite number such that for every c there exists a distinct p.
A092997
Least k such that 1 < c < n < p < k, where p is a prime and c is a composite number such that for every c there exists a distinct p.
Terms
- a(0) =3a(1) =4a(2) =5a(3) =8a(4) =8a(5) =14a(6) =14a(7) =18a(8) =20a(9) =30a(10) =30a(11) =38a(12) =38a(13) =42a(14) =44a(15) =54a(16) =54a(17) =62a(18) =62a(19) =68a(20) =72a(21) =80a(22) =80a(23) =84a(24) =90a(25) =98a(26) =102a(27) =108a(28) =108a(29) =114
External references
- oeis: A092997