A145292 -id:A145292 - cp's OEIS frontend

A241732 Primes p such that p^3 + 2 and p^3 - 2 are semiprime.

2, 11, 13, 17, 41, 89, 101, 239, 271, 331, 571, 641, 719, 1051, 1231, 1321, 1549, 1559, 1721, 1741, 1831, 1993, 1999, 2029, 2311, 2459, 2749, 2837, 2861, 2939, 3389, 3467, 3671, 4049, 4111, 4273, 4787, 4919, 4969, 5657, 5689, 5861, 6221, 6679, 6691, 6829, 7109

Offset: 1

K. D. Bajpai, Apr 27 2014

nonn

			11 is prime and appears in the sequence because 11^3 + 2 = 1333 = 31 * 43 and 11^3 - 2 = 1329 = 3 * 443, both are semiprime.
41 is prime and appears in the sequence because 41^3 + 2 = 68923 = 157 * 439 and 41^3 - 2 = 68919 = 3 * 22973, both are semiprime.

K. D. Bajpai, Table of n, a(n) for n = 1..2310

Cf. A001358, A063637, A063638, A072381, A082919, A145292, A228183, A237627, A241483, A241493, A241659.

with(numtheory): KD:= proc() local k; k:=ithprime(n); if bigomega(k^3+2)=2 and bigomega(k^3-2)=2 then k; fi; end: seq(KD(), n=1..2000);

A241732 = {}; Do[t = Prime[n]; If[PrimeOmega[t^3 + 2] == 2 && PrimeOmega[t^3 - 2] == 2, AppendTo[A241732, t]], {n, 500}]; A241732
Select[Prime[Range[1000]],PrimeOmega[#^3+2]==PrimeOmega[#^3-2]==2&] (* Harvey P. Dale, Jun 20 2019 *)

A268405 Numbers m such that m^2 + m + 41 is a product of 7 primes.

Original entry on oeis.org

3019035, 3312609, 4005577, 4205871, 4270887, 4502832, 4838229, 4933775, 5086008, 6142338, 6618260, 6932403, 6941996, 7263518, 7375900, 7643466, 7939002, 8268798, 8473961, 8485664, 8499341, 8892530, 8978097, 8991587, 9075462, 9317324, 9469974, 9709914, 9736792, 9745217

Offset: 1

Zak Seidov, Feb 04 2016

nonn

Note that a(1) = 3019035 = A228122(7) and a(11) = 6618260 = A145293(7).

Zak Seidov, Table of n, a(n) for n = 1..140

Cf. A145293, A228122, A268290, A005846, A007634, A145292, A145294, A145295.

A241607 Semiprimes generated by the polynomial (1/4)(n^5 - 133n^4 + 6729n^3 - 158379n^2 + 1720294*n - 6823316).

Original entry on oeis.org

5141923, 6084557, 11403823, 13201987, 17488411, 20017609, 33239291, 37446979, 42070423, 47139347, 72512623, 88747907, 118408673, 129881707, 169708339, 184952323, 201267887, 278376073, 324881567, 406044923, 436421497, 538566199, 616639427, 658920007, 750410069

Offset: 1

K. D. Bajpai, Apr 26 2014

nonn

(1/4)*(n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316) is a well known prime producing polynomial found by Shyam Sunder Gupta, which generates 57 distinct primes for n = 0,1,...,55,56.

For n = 57, this polynomial yields the first semiprime: 5141923 = 821 * 6263.

			For n=57: (1/4)*(n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316) = 5141923 = 821 * 6263, which is a semiprime and is included in the sequence.
For n=58: (1/4)*(n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316) = 6084557 = 131 * 46447, which is a semiprime and is included in the sequence.

K. D. Bajpai, Table of n, a(n) for n = 1..10000

Cf. A007641 (for primes).

Cf. A001358, A072381, A082919, A121887, A145292, A228183, A237627.

with(numtheory): KD:= proc() local a,b,k; k:=(1/4)*(n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316); a:=bigomega(k); if a=2 then RETURN (k); fi; end: seq(KD(), n=0..200);

A241607 = {}; Do[k= (1/4) * (n^5 - 133 * n^4 + 6729 * n^3 - 158379 * n^2 + 1720294 * n - 6823316); If[PrimeOmega[k] ==2, AppendTo[A241607, k]], {n,200}]; A241607
(*For the b-file:*) n=0;Do[t=((1/4) * (k^5 - 133 * k^4 + 6729 * k^3 - 158379 * k^2 + 1720294 * k - 6823316));If[PrimeOmega[t]==2, n++; Print[n," ",t]], {k,10^6}]

s=[]; for(n=1, 200, t=(1/4)*(n^5-133*n^4+6729*n^3-158379*n^2+1720294*n-6823316); if(bigomega(t)==2, s=concat(s, t))); s \\ Colin Barker, Apr 26 2014

A242243 Semiprimes sp of the form p^2 + q + 1 where p and q are consecutive primes.

Original entry on oeis.org

15, 33, 187, 309, 559, 1411, 1897, 2263, 2869, 3543, 6979, 10717, 11559, 11995, 22353, 32953, 39009, 54529, 57363, 58333, 66313, 77011, 80383, 113917, 120759, 124969, 147079, 158011, 167701, 175983, 177673, 237661, 241581, 253519, 299767, 310813, 376387, 381309

Offset: 1

K. D. Bajpai, May 09 2014

nonn

			a(1) = 15 = 3^2 + 5 + 1 = 3 * 5 is semiprime, 3 and 5 are consecutive primes.
a(2) = 33 = 5^2 + 7 + 1 = 3 * 11 is semiprime, 5 and 7 are consecutive primes.

K. D. Bajpai, Table of n, a(n) for n = 1..5970

Cf. A000040, A001358, A045636, A145292, A228183.

with(numtheory): A242243:= proc()local k ; k:=(ithprime(x)^2+ithprime(x+1)+1);if  bigomega(k)=2 then RETURN (k); fi;end: seq(A242243 (),x=1..500);

Select[Table[Prime[n]^2 + Prime[n + 1] + 1, {n, 500}], PrimeOmega[#] == 2 &]

A284043 Starts of a run of at least n consecutive numbers k for which k^2 - k + 41 is composite.

Original entry on oeis.org

41, 41, 122, 162, 299, 326, 326, 1064, 1064, 1064, 1064, 1064, 5664, 5664, 5664, 5664, 9265, 9265, 9265, 22818, 22818, 37784, 37784, 47494, 100202, 100202, 100202, 167628, 167628, 167628, 167628, 167628, 167628, 167628, 167628, 176956, 176956, 176956, 1081297

Offset: 1

Amiram Eldar, Jun 14 2017

nonn

This sequence is inspired by the problem proposed by Sidney Kravitz in 1963: "It is known that f(n)=n^2-n+41 yields prime numbers for n=1, 2, ..., 40. Find a sequence of 40 consecutive values of n for which f(n) is composite." Lawrence A. Ringenberg and others suggested the solution that starts at f(1)*f(2)*...*f(40)+1 (about 4.890... * 10^101). B. A. Hausmann suggested the smaller solution that starts at f(1)*f(2)*...*f(20)-19 (about 3.213... * 10^42). The smallest solution is a(40) = 1081297.

			The values of f(n)=n^2-n+41 at 122, 123 and 124 are: 14803 = 113*131, 15047 = 41*367 and 15293 = 41*373. This is the first case of 3 consecutive composite values, thus a(3) = 122.

Thomas Koshy, Elementary Number Theory with Applications, Academic Press, 2nd edition, 2007, Chapter 2, p. 147, exercise 50.

Amiram Eldar, Table of n, a(n) for n = 1..130 (terms below 10^10)
Sidney Kravitz, Problem 527, Mathematics Magazine, Vol. 36, No. 4 (1963), p. 264.
Lawrence A. Ringenberg et al., A Prime Generator, Solutions to Problem 527, Mathematics Magazine, Vol. 37, No. 2 (1964), pp. 122-123.

Cf. A002837, A005846, A007634, A056561, A145292, A202018.

f[n_] := n^2 - n + 41; a = PrimeQ[f[Range[1, 10^7]]]; b = Split[a]; c = Length /@ b; d = Accumulate[c]; nc = Length[c]; e = {}; For[len = 0, len < 100, len++; k = 2;  While[k <= nc && c[[k]] < len, k += 2]; If[k <= nc && c[[k]] >= len, ind = d[[k - 1]] + 1; e = AppendTo[e, ind]]]; e

A330673 The possible v-factors for any A202018(k) (while A202018(k) = v * w, v and w are integers, w >= v >= 41, v = w iff w = 41, all such v-factors form the set V).

Original entry on oeis.org

41, 43, 47, 53, 61, 71, 83, 97, 113, 131, 151, 163, 167, 173, 179, 197, 199, 223, 227, 251, 263, 281, 307, 313, 347, 359, 367, 373, 379, 383, 397, 409, 419, 421, 439, 457, 461, 487, 499, 503, 523, 547, 563, 577, 593, 607, 641, 647, 653, 661, 673, 677, 691, 701, 709, 733

Offset: 0

Sergey Pavlov, Dec 23 2019

nonn

This is different from A257362: a(n) = A257362(n+1) for n=0..109, but a(110) = 1468 != 1471 = A257362(111). - Alois P. Heinz, Mar 02 2020
A kind of prime number sieve for the numbers of form x^2+x+41 (for so-called Euler primes, or A005846).
A set of all composite Euler numbers of form x^2+x+41 could be written as a 4-dimensional matrix m(i,j,t,u); a set of all terms of a(n) could be written as a 3-dimensional matrix v(i,j,t), since, for any integer u > -1, and for any w-factor that has the same values for i, j, t, we have the same v-factor (u = -1 iff w = 41); see formulas below.
Theorem. Let m be a term of A202018. Then m is composite iff m == 0 (mod v), where v is a term of a(n), v <= sqrt(m) (v = sqrt(m) iff m = 1681); otherwise, m is prime. Moreover, while m == 0 (mod p) (p is prime, p <= sqrt(m), p = sqrt(m) iff m = 1681), p is a term of a(n).
While i = 1, any v(i,t,j) is a term of both A202018 and a(n) (trivial).
Any w is a term of V and of a(n) which is the superset of V.

			Let  i = 3, t = 1, j = -1. Then v(i,t,j) = m(j) * i^2 + b + ja = 41 * 3^2 + 4 - 6 = 41 * 9 - 2 = 367, and 367 is a term of a(n).
We could find all terms of a(n) v < 10^n and then all Euler primes p < 10^(2n) (for n > 1, number of all numbers m such that are terms of A202018 (and any m < 10^(2n)) is 10^n; trivial).
Let 2n = 10; it's easy to establish that, while i > 49, any v(i,t,j)^2 > 10^10; thus, we can use 0 < i < 50 to find all numbers v < 10^5. While m is a term of A202018, m < 10^10, m is composite iff there is at least one v such that m == 0 (mod v); otherwise, m is prime. We could easily remove all "false" numbers v that cannot be divisors of any m. Let p' be a regular prime (p' is a term of A000040, but not of a(n)) such that any 3p' < UB(i); in our case, any 3p' < 50. Thus, we could try any v with p' = {2,3,5,7,11,13}; if v == 0 (mod p'), it is "false"; otherwise, there is at least one m < 10^10 such that m == 0 (mod v).

Sergey Pavlov, Table of n, a(n) for n = 0..312
Sergey Pavlov, The Euler primes sieve (for the primes of form x^2+x+41; draft paper)

Cf. A005846, A145292, A202018, A257362.

Let j = {-1;0;-2;1;-3;2;...;-(n+1);n}, m(-1) = 41, m(0) = 41, etc. (while j is negative, m(j) = A202018(-(j+1)); while j is nonnegative, m(j) = A202018(j)). Any term of a(n) could be written at least once as v(i,t+1,j) = m(j) * i^2 + b + ja, where i, t, and j are integers (j could be negative), i > 2; a = (i^2 - 2i) - 2i(t - 1), b = a - ((i^2 - 4)/4 - ((t - 1)^2 + 2(t - 1))), 0 < t < (i/2), while i is even; a = (i^2 - i) - 2i(t - 1), b = a - ((i^2 - 1)/4 - ((t - 1)^2 + (t - 1))), 0 < t < ((i + 1)/2), while i is odd (Note: v(i,1,j) = v(i,i/2,j), while i is even; v(i,1,j) = v(i,(i + 1)/2,j), while i is odd); at i = 2, v(2,1,j) = 4 * m(j) + 3 + 4j (at i = 2, we use only j < 0); at i = 1, v(1,1,j) = m(j) (at i = 1, we use only j >= 0; trivial).

cp's OEIS Frontend

A241732 Primes p such that p^3 + 2 and p^3 - 2 are semiprime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A268405 Numbers m such that m^2 + m + 41 is a product of 7 primes.

Views

Author

Keywords

Comments

Links

Crossrefs

A241607 Semiprimes generated by the polynomial (1/4)*(n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A242243 Semiprimes sp of the form p^2 + q + 1 where p and q are consecutive primes.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A284043 Starts of a run of at least n consecutive numbers k for which k^2 - k + 41 is composite.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A330673 The possible v-factors for any A202018(k) (while A202018(k) = v * w, v and w are integers, w >= v >= 41, v = w iff w = 41, all such v-factors form the set V).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A241607 Semiprimes generated by the polynomial (1/4)(n^5 - 133n^4 + 6729n^3 - 158379n^2 + 1720294*n - 6823316).