The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054641 GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))). 2
 1, 6, 6, 6, 6, 42, 42, 210, 210, 210, 210, 3990, 3990, 43890, 43890, 43890, 43890, 1360590, 23130030, 23130030, 855811110, 855811110, 855811110, 855811110, 855811110, 855811110, 11125544430, 11125544430, 11125544430, 11125544430 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Values are repeated for several arguments: observed from 1 to 8 times below n=100. Sites of jump seems not so regular. From a sufficiently high value of n, A002110(n) divides the terms. E.g., from n=27, A002110(8) divides the values of this sequences. LINKS PROG (PARI) a(n)=gcd(prod(i=1, n, prime(i)), prod(i=1, n, prime(i)+1)) \\ Charles R Greathouse IV, Feb 19 2013 CROSSREFS Cf. A002110, A000203, A028815, A054640, A054642. Sequence in context: A285048 A265830 A116571 * A024731 A195504 A098537 Adjacent sequences:  A054638 A054639 A054640 * A054642 A054643 A054644 KEYWORD nonn AUTHOR Labos Elemer, May 15 2000 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 July 27 07:50 EDT 2021. Contains 346304 sequences. (Running on oeis4.)