%N On the Infinitude of Regular Primes.
%C If you graph a(n) versus n, an interesting pattern with random-looking fluctuations emerges.
%C As you go farther along the n-axis, greater are the number of Regular primes, on average, within each interval obtained.
%C The smallest count of 1 occurs only once at the very beginning.
%C I suspect all numbers in this sequence are > 0.
%C If one could prove that there is at least 1 Regular prime within each interval, this would imply that Regular primes are infinite.
%C This would be very significant since "Kummer was able to prove Fermat's Last Theorem in the case where the exponent is a regular prime, a result that prior to Wiles's recent work was the only demonstration of Fermat's Last Theorem for a large class of exponents." (see D. Jao).
%H C. K. Caldwell, The Prime Glossary, <a href="http://primes.utm.edu/glossary/page.php/Regular.html">Regular prime</a>
%H D. Jao, PlanetMath.Org, <a href="http://planetmath.org/encyclopedia/RegularPrime.html"> Regular prime</a>
%F Used the table of irregular primes by T.D. Noe in A000928 to extract a longer list of regular primes from a list of odd primes.
%e Take any pair of consecutive primes. Say the first (2,3). Square the first term, and then take the product of the two to obtain an interval (4,6). Within this interval, there is 1 Regular prime, which is 5. Hence the very first term of the sequence above is 1. Similarly, the second term, 2, refers to the two Regular primes 11 and 13.
%Y Cf. A007703, A000928.
%A _Jaspal Singh Cheema_, Mar 12 2010