WITH CTE_B AS (SELECT 2 AS START_NUM FROM DUAL ) , CTE_R(MOD_NUM) AS ( SELECT START_NUM AS MOD_NUM FROM CTE_B UNION ALL SELECT MOD_NUM + 1 FROM CTE_R WHERE MOD_NUM <=1000 ) SELECT LISTAGG(n.mod_num,'&') WITHIN GROUP (ORDER BY n.mod_num) FROM CTE_R n where not exists(select 1 from CTE_R d where d.mod_num < n.mod_num and d.mod_num > 1 and mod(n.mod_num ,d.mod_num) =0)

WITH RECURSIVE numbers AS ( SELECT 2 AS n UNION ALL SELECT n + 1 FROM numbers WHERE n <= 1000 ), divisors AS ( SELECT n.n AS num, d.n AS di FROM numbers n JOIN numbers d ON d.n <= FLOOR(SQRT(n.n)) ), non_primes AS ( SELECT DISTINCT num FROM divisors WHERE num % di = 0 ), primes AS ( SELECT n.n AS prime FROM numbers n WHERE n.n NOT IN (SELECT num FROM non_primes) ) SELECT GROUP_CONCAT(prime ORDER BY prime SEPARATOR '&') AS prime_list FROM primes;

with recursive cte as( select 2 as num union all select num+1 from cte where num < 1001 ), prime_num as ( select num from cte a where not exists ( select 1 from cte b where a.num > b.num and a.num%b.num = 0 ) ) select group_concat(num separator '&') from prime_num

SELECT LISTAGG(N,'&') WITHIN GROUP(ORDER BY N) PRIME_NO FROM( SELECT N FROM (SELECT LEVEL N FROM DUAL CONNECT BY LEVEL <=1000) WHERE N > 1 AND NOT EXISTS ( SELECT 1 FROM ( SELECT LEVEL D FROM DUAL CONNECT BY LEVEL <=1000 ) WHERE D >1 AND D < N AND MOD(N, D)=0 ) );

WITH RECURSIVE Numbers AS ( SELECT 2 AS n UNION ALL SELECT n + 1 FROM Numbers WHERE n < 1000 ), Divisors AS ( SELECT 2 AS d UNION ALL SELECT d + 1 FROM Divisors WHERE d < 31 -- 31 is approx sqrt(1000) ) SELECT GROUP_CONCAT(n SEPARATOR '&') AS PrimeNumbers FROM Numbers WHERE NOT EXISTS ( SELECT 1 FROM Divisors WHERE Divisors.d < Numbers.n AND Numbers.n % Divisors.d = 0 );