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.
%I A057588 #70 Nov 18 2024 04:25:43
%S A057588 1,5,29,209,2309,30029,510509,9699689,223092869,6469693229,
%T A057588 200560490129,7420738134809,304250263527209,13082761331670029,
%U A057588 614889782588491409,32589158477190044729,1922760350154212639069,117288381359406970983269,7858321551080267055879089
%N A057588 Kummer numbers: -1 + product of first n consecutive primes.
%C A057588 a(n) is congruent to -1 modulo the first n primes. - _Michael Engling_, Mar 31 2011
%C A057588 Named after the German mathematician Ernst Eduard Kummer (1810-1893). - _Amiram Eldar_, Jun 19 2021
%C A057588 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
%H A057588 T. D. Noe, <a href="/A057588/b057588.txt">Table of n, a(n) for n = 1..100</a>
%H A057588 E. E. Kummer, <a href="https://archive.org/details/monatsberichted01unkngoog/page/n837/">Neuer elementarer Beweis des Satzes, dass die Anzahl aller Primzahlen eine unendliche ist</a>, Monatsber. Preuss. Akad. Wiss., Berlin 1878/9, pp. 777-778. [Collected Papers, II, pp. 669-670, Springer, Berlin-Heidelberg, 1975.] Cited in Mestrovic.
%H A057588 Romeo Meštrović, <a href="http://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - From _N. J. A. Sloane_, Jun 13 2012
%H A057588 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha103.htm">Factorizations of many number sequences</a>.
%H A057588 Robert G. Wilson v, <a href="/A038507/a038507.txt">Explicit factorizations</a>.
%H A057588 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A057588 a(n) = A002110(n) - 1. - _Altug Alkan_, Oct 02 2015
%F A057588 a(n) = A006862(n) - 2. - _Antti Karttunen_, Nov 17 2024
%p A057588 seq(mul(ithprime(k), k=1..n) - 1, n=1..100); # _Muniru A Asiru_, Jan 19 2018
%t A057588 Table[Product[Prime[k], {k, 1, n}] - 1, {n, 1, 18}] (* _Artur Jasinski_, Jan 01 2007 *)
%t A057588 FoldList[Times,1,Prime[Range[20]]]-1 (* _Harvey P. Dale_, Apr 17 2011 *)
%t A057588 Table[ChineseRemainder[PadRight[{},n,-1],Prime[Range[n]]],{n,20}] (* _Harvey P. Dale_, Jul 01 2017 *)
%o A057588 (Haskell)
%o A057588 a057588 = (subtract 1) . product . (flip take a000040_list)
%o A057588 -- _Reinhard Zumkeller_, Mar 27 2013
%o A057588 (PARI) a(n) = prod(k=1, n, prime(k)) - 1; \\ _Michel Marcus_, Oct 02 2015
%o A057588 (Python)
%o A057588 from sympy import primorial
%o A057588 def A057588(n): return primorial(n)-1 # _Chai Wah Wu_, Feb 25 2023
%Y A057588 Cf. A002110, A006862, A057705 (primes), A000040, A000720.
%Y A057588 Subsequence of A048103.
%K A057588 nonn,easy,nice
%O A057588 1,2
%A A057588 Mario Velucchi (mathchess(AT)velucchi.it), Oct 05 2000
%E A057588 More terms from Larry Reeves (larryr(AT)acm.org), Oct 05 2000