cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 6, 42, 210, 3990, 43890, 1360590, 23130030, 855811110, 11125544430, 255887521890, 20215114229310, 828819683401710, 24035770818649590, 2331469769409010230, 123567897778677542190, 5313419604483134314170
Offset: 1

Views

Author

Labos Elemer, May 15 2000

Keywords

Comments

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}.

Crossrefs