give me an R code for outputing primes up to 1000 without using for loop

Here's an R code for outputting primes up to 1000 without using for loop:

# Generate primes up to 1000 without for loop

primes <- c(2, 3)  # start with 2 and 3

while (primes[length(primes)] < 1000) {  # keep adding primes until 1000 is reached
  n <- primes[length(primes)] + 2  # start with the next odd number after the last prime
  is_prime <- TRUE  # assume n is prime until proven otherwise
  for (p in primes[2:length(primes)]) {  # only need to check against existing primes
    if (n %% p == 0) {  # if n is divisible by p, n is not prime
      is_prime <- FALSE
      break  # no need to check further primes
    }
  }
  if (is_prime) {
    primes <- c(primes, n)  # add n to the list of primes if it is prime
  }
}

print(primes[primes <= 1000])  # print the primes up to 1000

The code uses a while loop to keep adding primes to the list until the last prime is greater than or equal to 1000. It starts with the primes 2 and 3 and then checks the next odd number for primality by dividing it by all previous primes up to the square root of the number. If it is not divisible by any previous primes, then it is added to the list of primes. Finally, the code prints the primes up to 1000