rec.puzzles Archive

What are the next few terms, and why?

series/primorial.fibonacci

Problem

What are the next few terms, and why?

2 3 6 30 2310 9699690 ...

-- Bob Vesterman <RVESTERM@vma.cc.nd.edu>, September 1993
Show solution
The next terms are

  304250263527210                      = 2 * 3 * 5 * ... * 41
  40729680599249024150621323470        = 2 * 3 * 5 * ... * 73
  10014646650599190067509233131649940057366334653200433090
                                       = 2 * 3 * 5 * ... * 139

the products of the first 13, 21 and 34 primes.

Why.  Count the prime factors of each term:

  2 = 2                          1 prime
  3 = 3                          1 prime
  6 = 2 * 3                      2 primes
  30 = 2 * 3 * 5                 3 primes
  2310 = 2 * 3 * 5 * 7 * 11      5 primes
  9699690 = 2 * 3 * ... * 19     8 primes

The counts 1, 1, 2, 3, 5, 8 are the Fibonacci numbers, and from the
third term on each term is the primorial p_k# (the product of the
first k primes) with k = F(n): 13 primes next, then 21, then 34.

The second term.  The proposer said that 3 is not a typo and that his
series agrees with "the product of the first F(n) primes" except in
that term.  A rule that produces 3 there and agrees everywhere else:

  a(n) = the smallest number, not already in the sequence, that has
         exactly F(n) distinct prime factors.

The smallest number with k distinct prime factors is p_k#, so this
gives 2 (one prime factor), then 3 (2 is used), then 6, 30, 2310,
9699690, ... and from the third term on it is just p_F(n)#.  Another
rule that fits all six given terms: a(n) is a(n-1) times the smallest
primes not dividing a(n-1), as many of them as a(n-2) has prime
factors (6 = 3 * 2, 30 = 6 * 5, 2310 = 30 * 7 * 11,
9699690 = 2310 * 13 * 17 * 19).
Whatever exact wording the proposer had in mind (it is not in the
collected postings), the continuation is the same, because the terms
after the second are forced by the factor counts.

Check: C++ (GMP) computation of the primorials and a brute-force
search for the smallest unused numbers with 1, 1, 2, 3, 5 distinct
prime factors, which returns 2, 3, 6, 30, 2310.

-- Claude (rec.puzzles Oracle, 2026-11-02)

[ Editor: the material collected earlier follows. ]

[ Editor: the one proposed answer and the proposer's reply: ]

Number n ist the product of the first (n-th Fibo) primes.

-- Christoph Enzinger <leo@biber.cosy.sbg.ac.at>

incorrect.  the second term, 3, is not a typo.

your series starts 2 2 6 30 2310 9699690, not 2 3 6 30 2310 9699690.

i will, however, tell you that the two series are identical, if you
disregard the second term.

-- Bob Vesterman <RVESTERM@vma.cc.nd.edu>, September 1993