A364266 -id:A364266 - cp's OEIS frontend

A006073 Numbers k such that k, k+1 and k+2 all have the same number of distinct prime divisors.

2, 3, 7, 20, 33, 34, 38, 44, 50, 54, 55, 56, 74, 75, 85, 86, 91, 92, 93, 94, 98, 115, 116, 117, 122, 133, 134, 141, 142, 143, 144, 145, 146, 158, 159, 160, 175, 176, 183, 187, 200, 201, 205, 206, 207, 212, 213, 214, 215, 216, 217, 224, 235, 247

Offset: 1

N. J. A. Sloane

nonn

Distinct prime divisors means that the prime divisors are counted without multiplicity. - Harvey P. Dale, Apr 19 2011

Harvey P. Dale, Table of n, a(n) for n = 1..10000

Cf. A001221, A006049, A045932.

pdQ[n_]:=PrimeNu[n]==PrimeNu[n+1]==PrimeNu[n+2]; Select[Range[250], pdQ] (* Harvey P. Dale, Apr 19 2011 *)
Take[Transpose[Flatten[Select[Partition[{#,PrimeNu[#]}&/@Range[250000], 3,1],#[[1,2]]==#[[2,2]]==#[[3,2]]&],1]][[1]],{1,-1,3}] (* Harvey P. Dale, Dec 09 2011 *)
Flatten[Position[Partition[PrimeNu[Range[250]],3,1],?(#[[1]]==#[[2]]== #[[3]]&),{1},Heads->False]] (* _Harvey P. Dale, Oct 30 2013 *)
SequencePosition[PrimeNu[Range[250]],{x_,x_,x_}][[;;,1]] (* Harvey P. Dale, Jun 12 2024 *)

Union of {2,3,7} and A364307 and A364308 and A364309 and A364266 and A364265 etc. - R. J. Mathar, Jul 18 2023

A364265 The first term in a chain of at least 3 consecutive numbers each with exactly 6 distinct prime factors (i.e., belonging to A074969).

Original entry on oeis.org

323567034, 431684330, 468780388, 481098980, 577922904, 639336984, 715008644, 720990620, 726167154, 735965384, 769385252, 808810638, 822981560, 831034918, 839075510, 847765554, 879549670, 895723268, 902976710, 903293468, 904796814, 918520420, 940737005, 944087484, 982059364

Offset: 1

R. J. Mathar, Jul 16 2023

nonn

To distinguish this from A259349: "Numbers n with exactly k distinct prime factors" means numbers with A001221(n) = omega(n) = k, which specifies that in the prime factorization n = Product_{i>=1} p_i^(e_i), e_i >= 1, the exponents are ignored, and only the size of the set of the (distinct) p_i is considered. In A259349, the numbers n are products of k distinct primes, which means in the prime factorization of n, all exponents e_i are equal to 1. (If all exponents e_i = 1, the n are squarefree, i.e., in A005117.) Rephrased: the n which are products of k distinct primes have A001221(n) = omega(n) = A001222(n) = bigomega(n) = k, whereas the n which have exactly k distinct prime factors are the superset of (weaker) requirement A001221(n) = omega(n) = k. - R. J. Mathar, Jul 18 2023

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

Cf. A259349 (requires squarefree). Subsequence of A273879.
Cf. A364266 (5 distinct factors).
See also A001221, A001222, A005117.
Numbers divisible by d distinct primes: A246655 (d=1), A007774 (d=2), A033992 (d=3), A033993 (d=4), A051270 (d=5), A074969 (d=6), A176655 (d=7), A348072 (d=8), A348073 (d=9).

omega := proc(n)
    nops(numtheory[factorset](n)) ;
end proc:
for k from 1 do
    if omega(k) = 6 then
        if omega(k+1) = 6 then
            if omega(k+2) = 6 then
                print(k) ;
            end if;
        end if;
    end if;
end do:

upto(n) = {my(res = List(), streak = 0); forfactored(i = 2, n, if(#i[2]~ == 6, streak++; if(streak >= 3, listput(res, i[1] - 2)), streak = 0)); res} \\ David A. Corneth, Jul 18 2023

a(1) = A138206(3).

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

More terms from David A. Corneth, Jul 18 2023

A192203 Numbers k such that k, k+1, and k+2 are each the product of exactly 5 distinct primes.

Original entry on oeis.org

16467033, 18185869, 21134553, 21374353, 21871365, 22247553, 22412533, 22721585, 24845313, 25118093, 25228929, 25345333, 25596933, 26217245, 27140113, 29218629, 29752345, 30323733, 30563245, 31943065, 32663265, 33367893, 36055045, 38269021, 39738061, 40547065

Offset: 1

Gil Broussard, Jun 25 2011

nonn

Numbers k such that k, k+1, and k+2 are all members of A046387. - N. J. A. Sloane, Jul 17 2024
A subsequence of A242608 intersect A016813. - M. F. Hasler, May 19 2014
All terms are congruent to 1 mod 4. - Zak Seidov, Dec 22 2014

			a(1)=16467033 because it is the product of 5 distinct primes (3,11,17,149,197), and so are a(1)+1: 16467034 (2,19,23,83,227), and a(1)+2: 16467035 (5,13,37,41,167).

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

Cf. A046387, A140079. Subsequence of A318964 and of A364266.

Cf. A039833, A066509, A176167.

SequencePosition[Table[If[PrimeNu[n]==PrimeOmega[n]==5,1,0],{n,164*10^5,406*10^5}],{1,1,1}][[;;,1]]+164*10^5-1 (* Harvey P. Dale, Jul 17 2024 *)

forstep(n=1+10^7,1e8,4, for(k=n,n+2,issquarefree(k)||next(2)); for(k=n,n+2,omega(k)==5||next(2));print1((n)", ")) \\ M. F. Hasler, May 19 2014

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

Original entry on oeis.org

20, 33, 34, 38, 44, 50, 54, 55, 56, 74, 75, 85, 86, 91, 92, 93, 94, 98, 115, 116, 117, 122, 133, 134, 141, 142, 143, 144, 145, 146, 158, 159, 160, 175, 176, 183, 187, 200, 201, 205, 206, 207, 212, 213, 214, 215, 216, 217, 224, 235, 247, 248, 295, 296

Offset: 1

R. J. Mathar, Jul 18 2023

nonn

			44 = 2^2*11 has 2 distinct prime factors, and so has 45 = 3^2*5 and so has 46 = 2*23, so 44 is in the sequence.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Subsequence of A006073 and of A074851.
Cf. A364308 (3 factors), A364309 (4 factors), A364266 (5 factors), A364265 (6 factors), A001221.
A039833 is a subsequence.

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

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

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}.

A364309 Numbers k such that k, k+1 and k+2 have exactly 4 distinct prime factors.

Original entry on oeis.org

37960, 44484, 45694, 50140, 51428, 55130, 55384, 61334, 63364, 64294, 67164, 68264, 68474, 70004, 70090, 71708, 72708, 76152, 80444, 81548, 81718, 82040, 84434, 85490, 86240, 90363, 95380, 97382, 98020, 99084, 99384, 99428, 99788, 100164, 100490, 100594, 102254, 102542, 104804, 105994, 108204

Offset: 1

R. J. Mathar, Jul 18 2023

nonn

			37960 = 2^3*5*13*73, 37961 = 7*11*17*29, and 37962 = 2*3^3*19*37 each have 4 distinct prime factors, so 37960 is in the sequence.

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

Subsequence of A006073 and of A140078.
A176167 is a subsequence.
Cf. A364307 (2 factors), A364308 (3 factors), A364266 (5 factors), A364265 (6 factors), A001221, A087966, A168628.

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

a(1) = A087966(3).
a(n)+1 = A168628(n).
{k: A001221(k) = A001221(k+1) = A001221(k+2) = 4}.

A364435 The first term in a run of at least 4 consecutive numbers each with exactly 5 distinct prime factors (i.e. belong to A051270).

Original entry on oeis.org

21871365, 37055184, 37227993, 39272583, 41205603, 43067463, 44012682, 44126949, 47761635, 48806274, 49362234, 49613484, 50582103, 52953795, 54244068, 60529077, 60988653, 61042069, 62319465, 63850344, 66068793, 66709683, 66710004, 67874079, 67974312, 68294148, 68529900

Offset: 1

David A. Corneth, Jul 24 2023

nonn

			21871365 is in the sequence as it starts a run of at least 4 consecutive numbers each with exactly 5 distinct prime factors.
That is each of 21871365 = 3 * 5 * 29 * 137 * 367, 21871365 + 1 = 21871366 = 2 * 11 * 37 * 97 * 277, 21871365 + 2 = 21871367 = 7*17*23*61*131, 21871365 + 3 = 21871368 = 2^3 * 3^2 * 31 * 41 * 239 have 5 distinct prime factors.

Cf. A051270, A364266.

upto(n) = {my(res = List(), streak = 0); n+=3; forfactored(i = 1, n, if(omega(i[2]) == 5, streak++; if(streak >= 4, listput(res, i[1]-3)), streak = 0)); res}

cp's OEIS Frontend

A006073 Numbers k such that k, k+1 and k+2 all have the same number of distinct prime divisors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A364265 The first term in a chain of at least 3 consecutive numbers each with exactly 6 distinct prime factors (i.e., belonging to A074969).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

PARI

Formula

Extensions

A192203 Numbers k such that k, k+1, and k+2 are each the product of exactly 5 distinct primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A364309 Numbers k such that k, k+1 and k+2 have exactly 4 distinct prime factors.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A364435 The first term in a run of at least 4 consecutive numbers each with exactly 5 distinct prime factors (i.e. belong to A051270).

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI