This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115658 a(n) is the smallest product of a(n-1) distinct primes; a(1) = 1. 2
 1, 2, 6, 30030 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A subsequence of A002110. a(5) = prime(a(4))# = prime(30030)# = 350741# [= A002110(30030)], a 152104-digit number. Compare with A007097 (primeth recurrence): The current sequence is analogously the primorial(e)th recurrence but grows faster even than A014221 (Ackermann function A_3(n+1)). This suggests considering the analogs also for factorials, hyperfactorials, etc., to see which may fit as OEIS entries. This sequence has tetrational growth. a(4) has 5 decimal digits; a(5) has 152,104 decimal digits; a(6) has about 2.1292101 * 10^152097 decimal digits. - Charles R Greathouse IV, Dec 09 2011 LINKS FORMULA a(n) = prime(a(n-1))# = prod(k=1, a(n-1), prime(k)) = A002110(a(n-1)) for n >= 2; a(1) = 1. EXAMPLE a(4) = prime(a(3))# = prime(6)# = 13# = 2*3*5*7*11*13 = 30030 [= A002110(6)]. CROSSREFS Cf. A014221 (similar but not squarefree), A007097. Sequence in context: A231545 A055698 A121167 * A005607 A184391 A161563 Adjacent sequences:  A115655 A115656 A115657 * A115659 A115660 A115661 KEYWORD nonn AUTHOR Rick L. Shepherd, Jan 28 2006 EXTENSIONS Name edited by Charles R Greathouse IV, Feb 02 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 26 05:23 EDT 2019. Contains 326328 sequences. (Running on oeis4.)