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.

A057588 Kummer numbers: -1 + product of first n consecutive primes.

Original entry on oeis.org

1, 5, 29, 209, 2309, 30029, 510509, 9699689, 223092869, 6469693229, 200560490129, 7420738134809, 304250263527209, 13082761331670029, 614889782588491409, 32589158477190044729, 1922760350154212639069, 117288381359406970983269, 7858321551080267055879089
Offset: 1

Views

Author

Mario Velucchi (mathchess(AT)velucchi.it), Oct 05 2000

Keywords

Comments

a(n) is congruent to -1 modulo the first n primes. - Michael Engling, Mar 31 2011
Named after the German mathematician Ernst Eduard Kummer (1810-1893). - Amiram Eldar, Jun 19 2021
Subsequence of A048103. Proof: For all primes p, when i >= A000720(p), neither p itself nor p^p divides a(i), but neither does p^p divide a(i) when i < A000720(p), as p^p > -1 + A034386(p). - Antti Karttunen, Nov 17 2024

Crossrefs

Subsequence of A048103.

Programs

  • Haskell
    a057588 = (subtract 1) . product . (flip take a000040_list)
    -- Reinhard Zumkeller, Mar 27 2013
    
  • Maple
    seq(mul(ithprime(k), k=1..n) - 1, n=1..100); # Muniru A Asiru, Jan 19 2018
  • Mathematica
    Table[Product[Prime[k], {k, 1, n}] - 1, {n, 1, 18}] (* Artur Jasinski, Jan 01 2007 *)
    FoldList[Times,1,Prime[Range[20]]]-1  (* Harvey P. Dale, Apr 17 2011 *)
    Table[ChineseRemainder[PadRight[{},n,-1],Prime[Range[n]]],{n,20}] (* Harvey P. Dale, Jul 01 2017 *)
  • PARI
    a(n) = prod(k=1, n, prime(k)) - 1; \\ Michel Marcus, Oct 02 2015
    
  • Python
    from sympy import primorial
    def A057588(n): return primorial(n)-1 # Chai Wah Wu, Feb 25 2023

Formula

a(n) = A002110(n) - 1. - Altug Alkan, Oct 02 2015
a(n) = A006862(n) - 2. - Antti Karttunen, Nov 17 2024

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Oct 05 2000