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-1 of 1 results.

A374006 Product of the first n primes greater than or equal to n.

Original entry on oeis.org

1, 2, 6, 105, 5005, 85085, 7436429, 215656441, 35336848261, 1448810778701, 62298863484143, 2928046583754721, 832363787945546597, 50774191064678342417, 18579448222667298067513, 1356299720254712758928449, 107147677900122307955347471, 8893257265710151560293840093
Offset: 0

Views

Author

Jesse Hammer, Jun 24 2024

Keywords

Comments

This sequence came up in the course of a currently ongoing investigation into Singmaster's conjecture by a group including the author of this sequence.

Examples

			a(4) is the product of the first four primes greater than or equal to 4: 5*7*11*13 = 5005.
		

Crossrefs

Programs

  • Maple
    a:= n-> mul((nextprime@@i)(n-1), i=1..n):
    seq(a(n), n=0..17);  # Alois P. Heinz, Jun 24 2024
  • Mathematica
    a[n_]:=Product[Prime[i],{i,1+PrimePi[n-1],n+PrimePi[n-1]}]; Array[a,18,0] (* Stefano Spezia, Jun 25 2024 *)
  • PARI
    a(n) = if (n==0, 1, my(p=nextprime(n)); vecprod(primes([p, prime(primepi(p)+n-1)]))); \\ Michel Marcus, Jun 25 2024

Formula

a(n) = Product_{i=1+pi(n-1)..n+pi(n-1)} prime(i).
a(n) = A272899(n) <=> n in A141468.
Showing 1-1 of 1 results.