OFFSET
1,1
COMMENTS
If n > 2, then a(n) = product of n-1 consecutive distinct prime divisors. E.g. a(5)=210, the product of 4 consecutive and distinct prime divisors, 2,3,5,7. - Enoch Haga, Dec 08 2007
From Bill McEachen, Jul 10 2022: (Start)
Rather than have code merely generating the conjectured values, one can compare values of sequence terms at the same position n. Specifically, locate new maximums where (p,p+even) are both prime, where even=2,4,6,8,... and the datum set is taken with even=4. A new maximum implies a new jumping champion.
Doing this produces the terms 2,4,6,30,210,2310,30030,.... Looking at the plot of a(n) ratio for gap=2/gap=6, the value changes VERY slowly, and is 2.14 after 50 million terms (one can see the trend via Plot 2 of A001359 vs A023201 (3rd option seqA/seqB vs n). The ratio for gap=4/gap=2 ~ 1, implying they are equally frequent. (End)
LINKS
R. P. Brent, The first occurrence of certain large prime gaps
C. K. Caldwell, The Prime Glossary, gaps between primes
C. K. Caldwell, The Prime Glossary, Jumping champion
S. Funkhouser, D. A. Goldston, D. Sengupta, and J. Sengupta, Prime Difference Champions, arXiv:1612.02938 [math.NT], 2016.
D. A. Goldston and A. H. Ledoan, Jumping champions and gaps between consecutive primes, Oct 15, 2009. [From Jonathan Vos Post, Oct 17 2009]
A. M. Odlyzko, M. Rubinstein, and M. Wolf, Jumping Champions
A. M. Odlyzko, M. Rubinstein, and M. Wolf, Jumping Champions
A. M. Odlyzko, M. Rubinstein, and M. Wolf, CHANCE News 10.02, 10. Jumping champions in the world of primes
A. M. Odlyzko, M. Rubinstein, and M. Wolf, Jumping Champions, Experiment. Math. 8(2): 107-118 (1999).
Tomás Oliveira e Silva, Gaps between consecutive primes
Ian Stewart, Jumping Champions, Scientific American, Vol. 283, No. 6 (2000), pp. 106-107; Wayback Machine link.
Eric Weisstein's World of Mathematics, Jumping Champion
FORMULA
Consists of 4 and the primorials (A002110).
a(1) = 2, a(2) = 4, a(3) = 6, a(n+1)/a(n) = Prime[n] for n>2.
MATHEMATICA
2, 4, Table[Product[Prime[k], {k, 1, n-1}], {n, 3, 30}]
PROG
(PARI) print1("2, 4"); t=2; forprime(p=3, 97, print1(", ", t*=p)) \\ Charles R Greathouse IV, Jun 11 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Lekraj Beedassy, Aug 10 2006
EXTENSIONS
Corrected and extended by Alexander Adamchuk, Aug 11 2006
Definition corrected and clarified by Jonathan Sondow, Aug 16 2011
STATUS
approved