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

A136349 Numbers k of the form Product_{j=1..m} prime(j) such that k-1 is prime.

Original entry on oeis.org

6, 30, 2310, 30030, 304250263527210, 23768741896345550770650537601358310
Offset: 1

Views

Author

Enoch Haga, Dec 25 2007

Keywords

Comments

This sequence is different from A121069 and A002110.
Compute the product of k consecutive sequences of prime factors 2,3,5,7, etc. where k=1,2,3,4,5, etc. When N is preceded by prime N-1 add N to the sequence.
a(7) = 1 9361386640 7008231634 7142505431 2320082662 8976125715 6376190696 2414215012 3698566371 7909694733 5243680669 6075314756 2914824028 4399976570 - copied from Data field by Michael B. Porter, Mar 30 2013
Next term (a(8)) is too large to be included: see A006794. - M. F. Hasler, May 02 2008
The next 7 terms in the sequence are a(7) = p# 2..89 (shown in full above), a(8) = p# 2..317, a(9) = p# 2..337, a(10) = p# 2..991, a(11) = p# 2..1873, a(12) = p# 2..2053, a(13) = p# 2..2377, where p# indicates a primorial. - Jeff Hall, Apr 05 2021

Examples

			a(3)=30 where the prime factors are 2,3,5; since N-1=29, prime, N=30 is added to the sequence.
		

Crossrefs

Programs

  • Mathematica
    Select[FoldList[Times,1,Prime[Range[70]]],PrimeQ[#-1]&]  (* Harvey P. Dale, Jan 09 2011 *)
  • PARI
    c=0;t=1;vector(7,n,until( ispseudoprime( -1+t*=prime(c++)),);t)

Formula

a(n) = A057705(n) + 1 = A034386( A006794(n) ). - M. F. Hasler, May 02 2008

Extensions

Edited by M. F. Hasler, May 02 2008, May 30 2008

A136351 Primorial numbers p# such that p# + 1 is a prime.

Original entry on oeis.org

1, 2, 6, 30, 210, 2310, 200560490130
Offset: 1

Views

Author

Enoch Haga, Dec 25 2007

Keywords

Comments

This sequence is different from A121069 and A002110.
a(8) = A002110(75) has 154 digits and is too long to be listed. - R. J. Mathar, Jul 23 2008

Examples

			a(6)=2310 is followed by prime 2311 whereas 30030 is not followed by a prime.
		

Crossrefs

Programs

  • Mathematica
    Select[FoldList[Times, 1, Prime[Range[18]]],PrimeQ[#+1]&] (* James C. McMahon, May 08 2025 *)
  • PARI
    S=[];for(n=0, 80, k=vecprod(primes(n)); if(isprime(k+1), S=concat(S,k))); S \\ Miles Englezou, Oct 28 2024

Formula

{A002110(j): A002110(j)+1 in A000040}. - R. J. Mathar, Jul 23 2008
a(n) = A002110(A014545(n)). - Michel Marcus, Apr 05 2021
a(n) = A018239(n) - 1. - James C. McMahon, May 08 2025

Extensions

Changed a(1) from 4 to 2 and edited by R. J. Mathar, Jul 23 2008
a(1)=1 inserted by James C. McMahon, May 08 2025

A136352 Primorials P for which neither P-1 nor P+1 is prime.

Original entry on oeis.org

510510, 9699690, 223092870, 6469693230, 7420738134810, 13082761331670030, 614889782588491410, 32589158477190044730, 1922760350154212639070, 117288381359406970983270, 7858321551080267055879090
Offset: 1

Views

Author

Enoch Haga, Dec 25 2007

Keywords

Comments

This sequence is different from A121069 and A002110.
For almost all primes p, p# is in this sequence by Brun's theorem. - Charles R Greathouse IV, Sep 14 2015

Examples

			13# = 30030 is preceded by a prime but is not followed by a prime. 17# = 510510 is neither preceded nor followed by a prime.
		

Crossrefs

Programs

  • Mathematica
    Select[FoldList[Times, 1, Prime[Range[19]]],!PrimeQ[#+1]&&!PrimeQ[#-1]&] (* James C. McMahon, May 08 2025 *)

Formula

Compute P = product of the first k primes. If P is neither preceded nor followed by a prime add P to the sequence.

Extensions

Edited by and more terms from Charles R Greathouse IV, Sep 29 2008

A136350 Primorial numbers #p such that (#p)-1 is composite.

Original entry on oeis.org

210, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810, 13082761331670030, 614889782588491410, 32589158477190044730, 1922760350154212639070, 117288381359406970983270
Offset: 1

Views

Author

Enoch Haga, Dec 25 2007

Keywords

Comments

This sequence is different from A121069 and A002110.

Examples

			a(1)=210 because 209=A002110(4)-1 is not prime.
		

Crossrefs

Programs

  • Mathematica
    Select[FoldList[Times, 1, Prime[Range[18]]],CompositeQ[#-1]&] (* James C. McMahon, May 08 2025 *)

Formula

{A002110(j): A002110(j)-1 in A002808}. - R. J. Mathar, Jul 23 2008

Extensions

Edited and extended by R. J. Mathar, Jul 23 2008

A231209 Smallest squarefree number k with 2^n ways to write k as k = x*y, where x, y = squarefree numbers, 1 <= x <= y <= k.

Original entry on oeis.org

1, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810, 304250263527210, 13082761331670030, 614889782588491410, 32589158477190044730, 1922760350154212639070
Offset: 0

Views

Author

Gerasimov Sergey, Nov 05 2013

Keywords

Comments

Primorial numbers without 2.

Examples

			a(0)=1 because squarefree number k=1 with 2^0=1 way to write k = x*y = 1*1 where x=1 and y=1 are squarefree numbers;
a(1)=6 because squarefree number k=6 with 2^1=2 ways to write k = x*y = 1*6 = 2*3 where 1, 6, 2, 3, are all squarefree numbers;
a(2)=30 because squarefree number k=30 with 2^2=4 ways to write k = 1*30 = 2*15 = 3*10 = 5*6 where 1, 30, 2, 15, 3, 10, 5, 6 are all squarefree numbers;
a(3)=210 because squarefree number k=210 with 2^3=8 ways to write k = 1*210 = 2*105 = 3*70 = 5*42 = 6*35 = 7*30 = 10*21 = 14*15 where 1, 210, 2, 105, 3, 70, 5, 42, 6, 35, 7, 30, 10, 21, 14, 15 are all squarefree numbers.
		

Crossrefs

Essentially the same as A002110 and A121069.

Extensions

Offset corrected by Peter Munn, Jan 03 2023
Name corrected by Peter Munn, Oct 04 2024
Showing 1-5 of 5 results.