A140077 -id:A140077 - cp's OEIS frontend

A140078 Numbers k such that k and k+1 have 4 distinct prime factors.

7314, 8294, 8645, 9009, 10659, 11570, 11780, 11934, 13299, 13629, 13845, 14420, 15105, 15554, 16554, 16835, 17204, 17390, 17654, 17765, 18095, 18290, 18444, 18920, 19005, 19019, 19095, 19227, 20349, 20405, 20769, 21164, 21489, 21735

Offset: 1

Artur Jasinski, May 07 2008

nonn

Goldston, Graham, Pintz, & Yildirim prove that this sequence is infinite. - Charles R Greathouse IV, Jun 02 2016

The subsequence of terms where k and k+1 are also squarefree is A318896. - R. J. Mathar, Jul 15 2023

David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 161 (entry for 7314).

Seiichi Manyama, Table of n, a(n) for n = 1..10000
D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yildirim, Small gaps between almost primes, the parity problem and some conjectures of Erdos on consecutive integers, arXiv:0803.2636 [math.NT], 2008.

Similar sequences with k distinct prime factors: A074851 (k=2), A140077 (k=3), this sequence (k=4), A140079 (k=5).
Cf. A093548.
Equals A321504 \ A321494.

a = {}; Do[If[Length[FactorInteger[n]] == 4 && Length[FactorInteger[n + 1]] == 4, AppendTo[a, n]], {n, 1, 100000}]; a (* Artur Jasinski, May 07 2008 *)
Transpose[Position[Partition[PrimeNu[Range[20000]],2,1],?(#[[1]] == #[[2]] == 4&),{1},Heads->False]][[1]] (* _Harvey P. Dale, Jun 21 2013 *)
SequencePosition[PrimeNu[Range[22000]],{4,4}][[;;,1]] (* Harvey P. Dale, Jun 20 2024 *)

isok(n) = (omega(n)==4) && (omega(n+1)==4); \\ Michel Marcus, Sep 04 2015

{k: k in A033993 and k+1 in A033993}. - R. J. Mathar, Jul 19 2023

Link provided by Harvey P. Dale, Jun 21 2013

A140079 Numbers n such that n and n+1 have 5 distinct prime factors.

Original entry on oeis.org

254540, 310155, 378014, 421134, 432795, 483405, 486590, 486794, 488565, 489345, 507129, 522444, 545258, 549185, 558789, 558830, 567644, 577940, 584154, 591260, 598689, 627095, 634809, 637329, 663585, 666995, 667029, 678755, 687939, 690234

Offset: 1

Artur Jasinski, May 07 2008

nonn

For the smallest number r such that r and r+1 have n distinct prime factors, see A093548.
Goldston, Graham, Pintz, & Yildirim prove that this sequence is infinite. - Charles R Greathouse IV, Jun 02 2016
Subsequence of the variant A321505 defined with "at least 5" instead of "exactly 5" distinct prime factors. See A321495 for the differences. - M. F. Hasler, Nov 12 2018
The subset of numbers where n and n+1 are also squarefree gives A318964. - R. J. Mathar, Jul 15 2023

Seiichi Manyama, Table of n, a(n) for n = 1..10000
D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim., Small gaps between almost primes, the parity problem and some conjectures of Erdos on consecutive integers, arXiv:0803.2636 [math.NT], 2008.

Cf. A074851, A140077, A140078, A273897.
Cf. A093548.
Equals A321505 \ A321495.

a = {}; Do[If[Length[FactorInteger[n]] == 5 && Length[FactorInteger[n + 1]] == 5, AppendTo[a, n]], {n, 1, 100000}]; a (*Artur Jasinski*)
Transpose[SequencePosition[Table[If[PrimeNu[n]==5,1,0],{n,700000}],{1,1}]][[1]] (* The program uses the SequencePosition function from Mathematica version 10 *) (* Harvey P. Dale, Jul 25 2015 *)

is(n)=omega(n)==5 && omega(n+1)==5 \\ Charles R Greathouse IV, Jun 02 2016

{k: k in A051270 and k+1 in A051270}. - R. J. Mathar, Jul 19 2023

A074851 Numbers k such that k and k+1 both have exactly 2 distinct prime factors.

Original entry on oeis.org

14, 20, 21, 33, 34, 35, 38, 39, 44, 45, 50, 51, 54, 55, 56, 57, 62, 68, 74, 75, 76, 85, 86, 87, 91, 92, 93, 94, 95, 98, 99, 111, 115, 116, 117, 118, 122, 123, 133, 134, 135, 141, 142, 143, 144, 145, 146, 147, 152, 158, 159, 160, 161, 171, 175, 176, 177, 183, 184

Offset: 1

Benoit Cloitre, Sep 10 2002

Subsequence of A006049. - Michel Marcus, May 06 2016

			20=2^2*5 21=3*7 hence 20 is in the sequence.

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A006049, A006549, A001221.
Analogous sequences for m distinct prime factors: this sequence (m=2), A140077 (m=3), A140078 (m=4), A140079 (m=5), A273879 (m=6).
Cf. A093548.
Equals A255346 \ A321502.

Filtered([1..200],n->[Size(Set(Factors(n))),Size(Set(Factors(n+1)))]=[2,2]); # Muniru A Asiru, Dec 05 2018

[n: n in [2..200] | #PrimeDivisors(n) eq 2 and #PrimeDivisors(n+1) eq 2]; // Vincenzo Librandi, Dec 05 2018

Flatten[Position[Partition[Table[If[PrimeNu[n]==2,1,0],{n,200}],2,1],{1,1}]] (* Harvey P. Dale, Mar 12 2015 *)

isok(n) = (omega(n) == 2) && (omega(n+1) == 2); \\ Michel Marcus, May 06 2016

import sympy
from sympy.ntheory.factor_ import primenu
for n in range(1,200):
    if primenu(n)==2 and primenu(n+1)==2:
        print(n, end=', '); # Stefano Spezia, Dec 05 2018

a(n) seems to be asymptotic to c*n*log(n)^2 with c=0.13...

{k: A001221(k) = A001221(k+1) = 2}. - R. J. Mathar, Jul 18 2023

A215217 Smaller member of a pair of sphenic twins, consecutive integers, each the product of three distinct primes.

Original entry on oeis.org

230, 285, 429, 434, 609, 645, 741, 805, 902, 969, 986, 1001, 1022, 1065, 1085, 1105, 1130, 1221, 1245, 1265, 1309, 1310, 1334, 1406, 1434, 1442, 1462, 1490, 1505, 1533, 1581, 1598, 1605, 1614, 1634, 1729, 1742, 1833, 1885, 1886, 1946, 2013, 2014, 2054, 2085

Offset: 1

Martin Renner, Aug 06 2012

nonn

455 is not a term of the sequence, since 455 = 5*7*13 is sphenic, i.e., the number of distinct prime factors is 3, though 456 = 2^3*3*19 has 3 distinct prime factors but is not sphenic, because the number of prime factors with repetition is 5 > 3.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A007304, A066509, A140077.

twinLow [] = []
twinLow [_] = []
twinLow (n : (m : ns))
    | m == n + 1 = n : twinLow (m : ns)
    | otherwise = twinLow (m : ns)
a215217 n = (twinLow a007304_list) !! (n - 1)
-- Peter Dolland, May 31 2019

Sphenics:= select(t -> (map(s->s[2],ifactors(t)[2])=[1,1,1]), {$1..10000}):
Sphenics intersect map(`-`,Sphenics,1); # Robert Israel, Aug 13 2014

Select[Range[2500], (PrimeNu[#] == PrimeOmega[#] == PrimeNu[#+1] == PrimeOmega[#+1] == 3)&] (* Jean-François Alcover, Apr 11 2014 *)
SequencePosition[Table[If[PrimeNu[n]==PrimeOmega[n]==3,1,0],{n,2500}],{1,1}][[All,1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 02 2017 *)

is_a033992(n) = omega(n)==3 && bigomega(n)==3
is(n) = is_a033992(n) && is_a033992(n+1) \\ Felix Fröhlich, Jun 10 2019

A321493 Numbers m such that m and m+1 both have at least 3, but m or m+1 has at least 4 distinct prime factors.

Original entry on oeis.org

714, 1364, 1595, 1770, 1785, 1869, 2001, 2090, 2145, 2184, 2210, 2261, 2345, 2379, 2414, 2639, 2805, 2820, 2849, 2870, 2925, 3002, 3009, 3059, 3080, 3219, 3255, 3289, 3354, 3366, 3444, 3450, 3485, 3534, 3654, 3689, 3705

Offset: 1

M. F. Hasler, Nov 13 2018

nonn

A321503 lists numbers m such that m and m+1 both have at least 3 distinct prime factors, while A140077 lists numbers such that m and m+1 have exactly 3 distinct prime factors. This sequence is the complement of the latter in the former, it consists of terms with indices (15, 60, 82, 98, 99, 104, ...) of the former.

Since m and m+1 can't share a prime factor, we have a(n)*(a(n)+1) >= p(3+4)# = A002110(7). Remarkably enough, a(1) = A000196(A002110(3+4)) exactly!

M. F. Hasler, Table of n, a(n) for n = 1..5000

Cf. A140077, A321503.

Cf. A321494, A321495, A321496, A321497 (analog for 4, 5, 6, 7 factors).

aQ[n_]:=Module[{v={PrimeNu[n],PrimeNu[n+1]}},Min[v]>2 && v!={3,3}]; Select[Range[120000], aQ] (* Amiram Eldar, Nov 12 2018 *)
dpfQ[{a_,b_}]:=a>2&&b>2&&(a>3||b>3); Position[Partition[PrimeNu[Range[4000]],2,1],?dpfQ]//Flatten (* _Harvey P. Dale, Apr 21 2025 *)

select( is(n)=omega(n)>2&&omega(n+1)>2&&(omega(n)>3||omega(n+1)>3), [1..1300])

A321503 \ A140077.

A321503 Numbers m such that m and m+1 both have at least 3 distinct prime factors.

Original entry on oeis.org

230, 285, 429, 434, 455, 494, 560, 594, 609, 615, 644, 645, 650, 665, 714, 740, 741, 759, 804, 805, 819, 825, 854, 860, 884, 902, 935, 945, 969, 986, 987, 1001, 1014, 1022, 1034, 1035, 1044, 1064, 1065, 1070, 1085, 1104, 1105, 1130, 1196, 1209, 1220, 1221, 1235, 1239, 1245, 1265

Offset: 1

M. F. Hasler, Nov 13 2018

nonn

Disjoint union of A140077 (omega({m, m+1}) = {3}) and A321493 (not both have exactly 3 prime divisors). The latter contains terms with indices {15, 60, 82, 98, 99, 104, ...} of this sequence.

Numbers m and m+1 can never have a common prime factor (consider them mod p), therefore the terms are > sqrt(A002110(3+3)), A002110 = primorial.

M. F. Hasler, Table of n, a(n) for n = 1..10000

Subsequence of A000977.
Cf. A255346, A321504 .. A321506, A321489 (analog for k = 2, ..., 7 prime divisors).
Cf. A321493, A321494 .. A321497 (subsequences of the above: m or m+1 has more than k prime divisors).
Cf. A074851, A140077, A140078, A140079 (complementary subsequences: m and m+1 have exactly k = 2, 3, 4, 5 prime divisors).

aQ[n_]:=Module[{v={PrimeNu[n], PrimeNu[n+1]}}, Min[v]>2]; Select[Range[1300], aQ] (* Amiram Eldar, Nov 12 2018 *)

select( is(n)=omega(n)>2&&omega(n+1)>2, [1..1300])

a(n) ~ n. - Charles R Greathouse IV, Jan 25 2025

A273879 Numbers k such that k and k+1 have 6 distinct prime factors.

Original entry on oeis.org

11243154, 13516580, 16473170, 16701684, 17348330, 19286805, 20333495, 21271964, 21849905, 22054515, 22527141, 22754589, 22875489, 24031370, 25348070, 25774329, 28098245, 28618394, 28625960, 30259229, 31846269, 32642805

Offset: 1

Charles R Greathouse IV, Jun 02 2016

nonn

Goldston, Graham, Pintz, & Yildirim prove that this sequence is infinite (Theorem 2).

			13516580 = 2^2 * 5 * 7 * 11 * 67 * 131 and 13516581 = 3 * 13 * 17 * 19 * 29 * 37 so 13516580 is in this sequence.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim, Small gaps between almost primes, the parity problem and some conjectures of Erdős on consecutive integers, arXiv:0803.2636 [math.NT], 2008.
D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim, Small gaps between almost primes, the parity problem and some conjectures of Erdős on consecutive integers, International Mathematics Research Notices 7 (2011), pp. 1439-1450.

Numbers k such that k and k+1 have j distinct prime factors: A006549 (j=1, apart from the first term), A074851 (j=2), A140077 (j=3), A140078 (j=4), A140079 (j=5).

Cf. A006049, A093548.

SequencePosition[PrimeNu[Range[3265*10^4]],{6,6}][[All,1]] (* Harvey P. Dale, Nov 20 2021 *)

PARI
```
is(n)=omega(n)==6 && omega(n+1)==6
```

a(1) = A138206(2). - R. J. Mathar, Jul 15 2023

{k: k in A074969 and k+1 in A074969.} - R. J. Mathar, Jul 19 2023

A364308 Numbers k such that k, k+1 and k+2 have exactly 3 distinct prime factors.

Original entry on oeis.org

644, 740, 804, 986, 1034, 1064, 1104, 1220, 1274, 1308, 1309, 1462, 1494, 1580, 1748, 1884, 1885, 1924, 1988, 2013, 2014, 2108, 2134, 2254, 2288, 2294, 2330, 2354, 2364, 2408, 2464, 2484, 2540, 2583, 2584, 2664, 2665, 2666, 2678, 2684, 2714, 2715, 2716, 2754, 2793

Offset: 1

R. J. Mathar, Jul 18 2023

nonn

			644 = 2^2*7*23 has 3 distinct prime factors, 645 = 3*5*43 has 3 distinct prime factors, and 646 = 2*17*19 has 3 distinct prime factors, so 644 is in the sequence.

David A. Corneth, Table of n, a(n) for n = 1..10000

Subsequence of A006073 and of A140077.

Cf. A364307 (2 factors), A364309 (4 factors), A364266 (5 factors), A364265 (6 factors), A001221, A080569.

q[n_] := q[n] = PrimeNu[n] == 3; Select[Range[3000], q[#] && q[#+1] && q[#+2] &] (* Amiram Eldar, Oct 01 2024 *)

a(1) = A080569(3).

{k: A001221(k) = A001221(k+1) = A001221(k+2) = 3}.

A168626 Numbers n such that n and n+-1 have 3 or more distinct prime factors.

Original entry on oeis.org

645, 741, 805, 987, 1035, 1065, 1105, 1221, 1275, 1309, 1310, 1463, 1495, 1581, 1749, 1885, 1886, 1925, 1989, 2014, 2015, 2109, 2135, 2211, 2255, 2261, 2289, 2295, 2331, 2355, 2365, 2379, 2409, 2465, 2485, 2541, 2584, 2585, 2665, 2666, 2667, 2679, 2685

Offset: 1

Vladimir Joseph Stephan Orlovsky, Dec 01 2009

nonn

Subsequence of A321503 and hence of A000977.

Cf. A140077

f[n_]:=Length[FactorInteger[n]]; lst={};Do[If[f[n]>=3&&f[n-1]>=3&&f[n+1]>=3,AppendTo[lst,n]],{n,7!}];lst
Mean/@SequencePosition[Table[If[PrimeNu[n]>2,1,0],{n,2700}],{1,1,1}] (* The program uses the SequencePosition function from Mathematica version 10 *) (* Harvey P. Dale, Jun 05 2016 *)

is(n)=omega(n)>2 && omega(n-1)>2 && omega(n+1)>2 \\ Charles R Greathouse IV, Jan 25 2025

a(n) ~ n. - Charles R Greathouse IV, Jan 25 2025

Definition clarified by Harvey P. Dale, Jun 05 2016

A321489 Numbers m such that both m and m+1 have at least 7 distinct prime factors.

Original entry on oeis.org

965009045, 1068044054, 1168008204, 1177173074, 1209907985, 1218115535, 1240268490, 1338753129, 1344185205, 1408520805, 1477640450, 1487720234, 1509981395, 1663654629, 1693460405, 1731986894, 1758259425, 1819458354, 1821278459, 1826445984, 1857332840

Offset: 1

Amiram Eldar and M. F. Hasler, Nov 12 2018

nonn

The first 300 terms of this sequence are such that m and m+1 both have exactly 7 prime divisors. See A321497 for the terms m such that m or m+1 has more than 7 prime factors: the smallest such term is 5163068910.
Numbers m and m+1 can never have a common prime factor (consider them mod p), therefore the terms are > sqrt(p(7+7)#) = A003059(A002110(7+7)). (Here we see that sqrt(p(7+8)#) is a more realistic estimate of a(1), but for smaller values of k we may have sqrt(p(2k+1)#) > m(k) > sqrt(p(2k)#), where m(k) is the smallest of two consecutive integers each having at least k prime divisors. For example, A321503(1) < sqrt(p(3+4)#) ~ A321493(1).)
From M. F. Hasler, Nov 28 2018: (Start)
The first 100 terms and beyond are all congruent to one of {14, 20, 35, 49, 50, 69, 84, 90, 104, 105, 110, 119, 125, 129, 134, 140, 144, 170, 174, 189, 195} mod 210. Here, 35, 195, 189, 14 140, 20 and 174 (in order of decreasing frequency) occur between 6 and 13 times, and {49, 50, 110, 129, 134, 144, 170} occur only once.
However, as observed by Charles R Greathouse IV, one can construct a term of this sequence congruent to any given m > 0, modulo any given n > 0.
The first terms of this sequence which are multiples of 210 are in A321497. An example of a term that is a multiple of 210 but not in A321497 is 29759526510, due to Charles R Greathouse IV. Such examples can be constructed by solving A*210 + 1 = B for A having 3 distinct prime factors not among {2, 3, 5, 7}, B having 7 distinct prime factors and gcd(B, 210*A) = 1. (End)

			a(1) = 5 * 7 * 11 * 13 * 23 * 83 * 101, a(1)+1 = 2 * 3 * 17 * 29 * 41 * 73 * 109.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 (first 102 terms from M. F. Hasler)

Cf. A255346, A321503 .. A321506 (analog for k = 2, ..., 6 prime divisors).
Cf. A321502, A321493 .. A321497 (m and m+1 have at least but not both exactly k = 2, ..., 7 prime divisors).
Cf. A074851, A140077, A140078, A140079 (m and m+1 both have exactly k = 2, 3, 4, 5 prime divisors).
Cf. A006049, A006549, A093548.
Cf. A002110.

Select[Range[36000000], PrimeNu[#] > 6 && PrimeNu[# + 1] > 6 &]

is(n)=omega(n)>6&&omega(n+1)>6
A321489=List();for(n=965*10^6,1.8e9,is(n)&&listput(A321489,n))

a(n) ~ n. - Charles R Greathouse IV, Nov 29 2018

cp's OEIS Frontend

A140078 Numbers k such that k and k+1 have 4 distinct prime factors.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A140079 Numbers n such that n and n+1 have 5 distinct prime factors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A074851 Numbers k such that k and k+1 both have exactly 2 distinct prime factors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Python

Formula

A215217 Smaller member of a pair of sphenic twins, consecutive integers, each the product of three distinct primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

A321493 Numbers m such that m and m+1 both have at least 3, but m or m+1 has at least 4 distinct prime factors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A321503 Numbers m such that m and m+1 both have at least 3 distinct prime factors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A273879 Numbers k such that k and k+1 have 6 distinct prime factors.

Views

Author

Keywords

Comments

Examples