I have always been curious about the distance between prime numbers. I call the sequence above the frog numbers because I don't know what else to call them. They are generated from the first n odd primes. How many consecutive integers are divisible by at least one of the set. Then add 1. For example, only one consecutive number is divisible by 3. Add 1 and you get 2. Only 2 consecutive numbers can be divisible by 3 or 5. Add 1 and you get 3. Etc. I don't have the mathematical horsepower to analyze the sequence and I am wondering if someone can give me more information on it? Is there efficient algorithm for generating lots of these numbers? I did write a program to generate the frog numbers in the title above. It is interesting how closely they track the primes.(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Next number in the sequence 2 3 5 7 11 13 17 20 23 29 33

**Physics Forums | Science Articles, Homework Help, Discussion**