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.

A099788 a(n) = Product_{i=1..2n} prime(i).

This page as a plain text file.
%I A099788 #27 Sep 08 2022 08:45:15
%S A099788 1,6,210,30030,9699690,6469693230,7420738134810,13082761331670030,
%T A099788 32589158477190044730,117288381359406970983270,
%U A099788 557940830126698960967415390,3217644767340672907899084554130,23768741896345550770650537601358310,232862364358497360900063316880507363070
%N A099788 a(n) = Product_{i=1..2n} prime(i).
%H A099788 Vincenzo Librandi, <a href="/A099788/b099788.txt">Table of n, a(n) for n = 0..100</a>
%p A099788 a:=n-> mul(ithprime(j),j=1..2*n): seq(a(n),n=0..13); # _Emeric Deutsch_
%t A099788 Table[Product[Prime[i], {i, 2n}], {n, 0, 20}] (* _Wesley Ivan Hurt_, Mar 13 2014 *)
%o A099788 (PARI) a(n) = prod(i=1, 2*n, prime(i)); \\ _Michel Marcus_, Mar 15 2014
%o A099788 (Magma) [1] cat [&*[NthPrime(j): j in [1..2*n]]: n in [1..20]]; // _G. C. Greubel_, Sep 04 2019
%o A099788 (Sage) [1]+[product(nth_prime(j) for j in (1..2*n)) for n in (1..20)] # _G. C. Greubel_, Sep 04 2019
%Y A099788 Cf. A000040, A099800.
%Y A099788 Bisection of A002110.
%Y A099788 Subset of A030229.
%K A099788 nonn,easy
%O A099788 0,2
%A A099788 _N. J. A. Sloane_, Nov 19 2004
%E A099788 More terms from _Emeric Deutsch_, Feb 23 2005
%E A099788 Name revised by _Wesley Ivan Hurt_, Mar 13 2014