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.

Showing 1-2 of 2 results.

A054640 a(n) is the sum of the divisors of the n-th primorial: a(n) = A000203(A002110(n)).

Original entry on oeis.org

1, 3, 12, 72, 576, 6912, 96768, 1741824, 34836480, 836075520, 25082265600, 802632499200, 30500034969600, 1281001468723200, 56364064623820800, 2705475101943398400, 146095655504943513600, 8765739330296610816000, 543475838478389870592000, 36956357016530511200256000
Offset: 0

Views

Author

Labos Elemer, May 15 2000

Keywords

Crossrefs

Programs

  • Magma
    [1/2*&*[(1+NthPrime(k)): k in [0..n-1]]: n in [1..19]]; // Vincenzo Librandi, May 08 2017
    
  • Maple
    a:= n-> mul(1+ithprime(j), j=1..n): seq(a(n), n=0..20); # Zerinvary Lajos, Aug 24 2008
  • Mathematica
    Table[Product[1 + Prime[i], {i,n-1}], {n,100}] (* Geoffrey Critzer, Dec 01 2014 *)
  • PARI
    a(n)=prod(i=1,n,prime(i)+1) \\ Charles R Greathouse IV, Feb 13 2013
    
  • SageMath
    def A054640(n): return product(nth_prime(j)+1 for j in range(1,n+1))
    [A054640(n) for n in range(41)] # G. C. Greubel, Aug 05 2024

Formula

a(n+1) = a(n)*(prime(n) + 1) = a(n)*A028815(n) (quotient=n-th prime+1 starting with 2).
a(n) ~ (6/Pi^2) * exp(gamma) * A002110(n) * log(prime(n)) + O(A002110(n)) (Jakimczuk, 2017). - Amiram Eldar, Feb 17 2021
a(n) = a(n-1) * A008864(n). - Flávio V. Fernandes, Mar 20 2021
a(n) = A002110(n) + A074107(n), a(n) <= A070826(1+n) [= A002110(1+n)/2] < A051674(n). - Antti Karttunen, Nov 19 2024

Extensions

a(0)=1 prepended by Alois P. Heinz, Apr 01 2021

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

Showing 1-2 of 2 results.