login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054642 Distinct values of GCD of divisor sum of primorials and primorial itself: gcd(A002110(n), A000203(A002110(n))). 1

%I #8 Oct 26 2019 02:05:21

%S 1,6,42,210,3990,43890,1360590,23130030,855811110,11125544430,

%T 255887521890,20215114229310,828819683401710,24035770818649590,

%U 2331469769409010230,123567897778677542190,5313419604483134314170

%N Distinct values of GCD of divisor sum of primorials and primorial itself: gcd(A002110(n), A000203(A002110(n))).

%C Below n=100, 30 values arise and if large enough are divisible by large primorials. E.g., for n=1..30, a(n) mod 510510 = {1, 6, 42, 210, 3990, 43890, 339570, 157080, 196350, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}.

%Y Cf. A000203, A002110, A054640, A054641.

%K nonn

%O 1,2

%A _Labos Elemer_, May 15 2000

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)