A014613 -id:A014613 - cp's OEIS frontend

A125149 a(n) is the least k such that the n-almost prime count is positive and equal to the (n-1)-almost prime count. a(0) = 1.

1, 2, 10, 15495, 151165506066

Offset: 0

Jonathan Vos Post and Robert G. Wilson v, Jan 07 2007

Unlike any of the prime number races in which any particular form may lead or trail, this sequence demonstrates that although the count of numbers having k prime factors begins by trailing the count for k-1 prime factors, eventually they exchange positions in the race. This can be seen by looking at A126279 or A126280.
The fundamental theorem of arithmetic, or unique factorization theorem, states that every natural number greater than 1 either is itself a prime number, or can be written as a unique product of prime numbers. It had a proof sketched by Euclid, then corrected and completed in "Disquisitiones Arithmeticae" [Carl Friedrich Gauss, 1801]. It fails in many rings of algebraic integers [Ernst Kummer, 1843], a discovery initiating algebraic number theory. Counting the elements in the unique product of prime numbers classifies natural numbers into primes, semiprimes, 3-almost primes and so on. This sequence quantifies a previously undescribed structure to that classification.
We took the first k where the two relevant counts are the same. If instead we took the least k such that the n-almost prime count from k onwards exceeds the (n-1)-almost prime count, the sequence would begin: 3, 34, 15530, ... [see A180126].
The prime count and the semiprime count are identical for 1, 10, 15, 16, 22, 25, 29, 30, 33.
The semiprime count and the 3-almost prime count are identical for 1, 2, 3, 15495, 15496, 15497, 15498, 15508, 15524, 15525, 15529.
The numbers of 3-almost primes and 4-almost primes are equal at 151165506066 and 731 larger numbers, the last one being 151165607041. See A180126. - T. D. Noe, Aug 11 2010
Landau's asymptotic formula suggests that a(n) is about exp(exp(n-1)). - Charles R Greathouse IV, Mar 14 2011

			a(1) = 2 since 1 has no prime factors and 2 has one prime factor, therefore prime factor counts of 0 and 1 occur equally often in the first 2 integers.
a(2) = 10 since there are 4 primes {2, 3, 5 & 7} and 4 semiprimes {4, 6, 9 & 10} less than or equal to 10.
a(4) = 151165506066 since there are 32437255807 4-almost primes and 3-almost primes <= a(4).

Andrew Granville and Greg Martin, Prime Number Races, arXiv:math/0408319 [math.NT], Aug 24 2004.
Eric Weisstein's World of Mathematics, Fundamental Theorem of Arithmetic.
Eric Weisstein's World of Mathematics, Modular Prime Counting Function.
Eric Weisstein's World of Mathematics, Prime Factor.

Cf. A126279, A126280, A117526.
Sequences listing r-almost primes, that is, k such that A001222(k) = r: A000040 (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), A046312 (r = 9), A046314 (r = 10), A069272 (r = 11), A069273 (r = 12), A069274 (r = 13), A069275 (r = 14), A069276 (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20).
Cf. A180126.

AlmostPrimePi[k_Integer, n_] := Module[{a, i}, a[0] = 1; If[k == 1, PrimePi[n], Sum[PrimePi[n/Times @@ Prime[Array[a, k - 1]]] - a[k - 1] + 1, Evaluate[ Sequence @@ Table[{a[i], a[i - 1], PrimePi[(n/Times @@ Prime[Array[a, i - 1]])^(1/(k - i + 1))]}, {i, k - 1}]]]]]; (* Eric W. Weisstein, Feb 07 2006 *)
f[n_] := Block[{k = 2^n}, While[AlmostPrimePi[n, k] < AlmostPrimePi[n - 1, k], k++ ]; k];

Changed 33 to 34 in a comment. - T. D. Noe, Aug 11 2010

Edited by Peter Munn, Dec 17 2022

A112314 Number of partitions of n into products of 4 primes.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 3, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 1, 0, 1, 0, 5, 0, 0, 0, 3, 0, 1, 0, 5, 1, 0, 0, 4, 0, 1, 0, 7, 0, 2, 0, 4, 0, 2, 0, 9, 1, 0, 0, 7, 0, 2, 0, 10, 1

Offset: 0

Jonathan Vos Post and Ray Chandler, Sep 02 2005

nonn

			a(48) = 2 since 48 = 24+24 = 16+16+16.

Alois P. Heinz, Table of n, a(n) for n = 0..5000

Cf. A014613, A000607, A101049, A112313, A112315, A112316.

A114414 Records in 4-almost prime gaps ordered by merit.

Original entry on oeis.org

8, 12, 14, 21, 28

Offset: 1

Jonathan Vos Post, Nov 25 2005

Next term (if it exists) associated with A014613 > 1030000. - R. J. Mathar, Mar 13 2007

			Records defined in terms of A114404 and A014613:
  n  A114404(n)  A114404(n)/log_10(A014613(n))
  =  ==========  =============================
  1      8       8/log_10(16)   = 6.64385619
  2      12      12/log_10(24)  = 8.6943213
  3      4       4/log_10(36)   = 2.57019442
  4      14      14/log_10(40)  = 8.73874891
  5      2       2/log_10(54)   = 1.15447195
  6      4       4/log_10(56)   = 2.2880834
  7      21      21/log_10(60)  = 11.810019
  ...
  13     22      22/log_10(104) = 10.9071078
  ...
  21     28      28/log_10(156) = 12.7671725

Cf. A014613, A065516, A111870, A111871, A114403-A114411, A114412-A114422.

Digits := 16 : A114414 := proc() local n,a014613,a114414,rec ; a014613 := 16 ; a114414 := 8 ; rec := a114414/log(a014613) ; print(a114414) ; n := 17 ; while true do while numtheory[bigomega](n) <> 4 do n := n+1 ; od ; a114414 := n-a014613 ; if ( evalf(a114414/log(a014613)) > evalf(rec) ) then rec := a114414/log(a014613) ; print(a114414) ; fi ; a014613 := n ; n := n+1 : od ; end: A114414() ; # R. J. Mathar, Mar 13 2007

a(n) = records in A114404(n)/log_10(A014613(n)) = records in (A014613(n+1) - A014613(n))/log_10(A014613(n)).

A146295 Integers which are not the sum of a 4-almost prime and a prime.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 20, 22, 24, 25, 28, 30, 32, 34, 36, 40, 44, 46, 48, 50, 52, 54, 60, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 96, 108, 114, 116, 120, 126, 130, 132, 136, 144, 150, 156, 162, 168, 174, 180, 204, 210, 216, 240, 246, 258

Offset: 2

Donovan Johnson, Nov 05 2008

Largest term is 60060 (see b-file). No more terms < 10^8. Conjectured to be complete.

			20 is in this sequence because no 4-almost prime and a prime sum to 20. 21 is not in this sequence because the sum of 16 (4-almost prime) and 5 (prime) is 21.

Donovan Johnson, Table of n, a(n) for n=2..196

Cf. A000040, A014613, A130588, A146296, A146297.

Complement[Range[1000], Union@Flatten@Outer[Plus, Select[Range[1000], PrimeOmega[#] == 4 &], Prime[Range[PrimePi[1000]]]]] (* Robert Price, Jun 16 2019 *)

A180150 Numbers n such that n and n+2 are both divisible by exactly 4 primes (counted with multiplicity).

Original entry on oeis.org

54, 88, 150, 196, 232, 248, 294, 306, 328, 340, 342, 348, 460, 488, 490, 568, 570, 664, 712, 738, 774, 850, 856, 858, 868, 870, 948, 1012, 1014, 1060, 1096, 1110, 1148, 1190, 1204, 1206, 1208, 1210, 1218, 1254, 1274, 1276, 1290, 1302, 1314, 1420, 1430, 1448

Offset: 1

Jonathan Vos Post, Aug 12 2010

"Quadruprimes" or "4-almost primes" that keep that property when incremented by 2. This sequence is to 4 as 3 is to A180117, as A092207 is to 2, and as A001359 is to 1. That is, this sequence is the 4th row of the infinite array A[k,n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity). The first row is the lesser of twin primes. The second row is the sequence such that m and m+2 are both semiprimes.

			a(1) = 54 because 54 = 2 * 3^3 is divisible by exactly 4 primes (counted with multiplicity), and so is 54+2 = 56 = 2^3 * 7.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A000040, A001222, A001358, A014614, A033987, A101637, A114106 (number of 4-almost primes <= 10^n).

SequencePosition[PrimeOmega[Range[1500]],{4,,4}][[;;,1]] (* _Harvey P. Dale, Jan 14 2024 *)

is(n)=bigomega(n)==4 && bigomega(n+2)==4 \\ Charles R Greathouse IV, Jan 31 2017

{m in A014613 and m+2 in A014613} = {m such that bigomega(m) = bigomega(m+2) = 4} = {m such that A001222(m) = A001222(m+2) = 4}.

More terms from R. J. Mathar, Aug 13 2010

A207790 Permutation of positive numbers. See comments.

Original entry on oeis.org

1, 2, 4, 3, 8, 5, 6, 7, 16, 11, 9, 13, 12, 17, 10, 19, 32, 23, 14, 29, 18, 31, 15, 37, 24, 41, 21, 43, 20, 47, 22, 53, 64, 59, 25, 61, 27, 67, 26, 71, 36, 73, 33, 79, 28, 83, 34, 89, 48, 97, 35, 101, 30, 103, 38, 107, 40, 109, 39, 113, 42, 127, 46, 131, 128, 137, 49, 139, 44, 149, 51, 151

Offset: 1

Vladimir Shevelev and Peter J. C. Moses, Feb 20 2012

nonn

a(1)=1; on places 2,4,6,8,... we put primes (A000040); on places 3,7,11,15,... we put products of two primes (A001358); on places 5,13,21,29,... we put products of three primes (A014612); on places 9,25,41,57,... we put products of four primes (A014613); on places 17,49,81,... we put products of five primes (A014614); etc.
Primes with the index not exceeding n have density 1/2, semiprimes have density 1/4, etc.
By our system, here and in  A207800, A207801, A207802 we used the order: a(1)=1; the first appearance  of a new kind of numbers in places of the form 2^k+1, k=0,1,2,..., with  period of the appearance 2^{k+1}.

Ivan Neretin, Table of n, a(n) for n = 1..8192

Cf. A057114.

mx = 72; a = Array[1 &, mx]; cnt = mx - 1; offs = Table[2^(i - 1) + 1, {i, 1, mx}]; n = 1; While[cnt > 0, n++; idx = PrimeOmega[n]; pos = offs[[idx]]; If[pos > mx, Continue[]]; offs[[idx]] += 2^idx; a[[pos]] = n; cnt--]; a (* Ivan Neretin, May 06 2015 *)

For n>1, a(n) = A078840(A249725(n-1)). - Ivan Neretin, Apr 30 2016

A076578 Triangular numbers which are 4-almost primes.

Original entry on oeis.org

36, 136, 210, 276, 351, 666, 820, 1035, 1225, 1275, 1326, 1431, 1770, 1830, 1953, 2145, 2346, 2415, 2775, 2926, 3003, 3486, 3916, 4005, 4186, 4278, 5050, 5356, 5565, 6105, 6555, 6670, 6903, 7626, 8001, 8385, 8646, 9316, 9730, 10731, 11175, 11325, 11476, 11935

Offset: 1

Shyam Sunder Gupta, Oct 19 2002

			36 is a term because it is a triangular number and 36 = 2*2*3*3, i.e., is a product of 4 prime factors so is a 4-almost prime.

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Intersection of A000217 and A014613.

Cf. A068443, A075875.

q:= n-> is(numtheory[bigomega](n)=4):
select(q, [i*(i+1)/2$i=0..200])[];  # Alois P. Heinz, Mar 27 2024

q[n_] := PrimeOmega[n] == 4;
Select[Table[i*(i+1)/2, {i, 0, 200}], q] (* Jean-François Alcover, Jan 13 2025, after Alois P. Heinz *)

A110893 Numbers with a semiprime number of prime divisors (counted with multiplicity).

Original entry on oeis.org

16, 24, 36, 40, 54, 56, 60, 64, 81, 84, 88, 90, 96, 100, 104, 126, 132, 135, 136, 140, 144, 150, 152, 156, 160, 184, 189, 196, 198, 204, 210, 216, 220, 224, 225, 228, 232, 234, 240, 248, 250, 260, 276, 294, 296, 297, 306, 308, 315, 324, 328, 330, 336, 340, 342

Offset: 1

Jonathan Vos Post, Sep 20 2005

Below 256 = 2^8 this is identical to A067028 (Numbers with a composite number of prime factors, counted with multiplicity).

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A000040, A001222, A001358, A014613, A046306, A046312, A046314, A063989, A067028, A069276.

is(n)=n>9 && bigomega(bigomega(n))==2 \\ Charles R Greathouse IV, Jan 31 2017

a(n) such that A001222(a(n)) is an element of A001358. a(n) such that bigomega(a(n)) is an element of A001358. Union[4-almost primes(A014613), 6-almost primes(A046306), 9-almost primes(A046312), 10-almost primes(A046314), 14-almost primes(A069275), 15-almost primes(A069276), 21-almost primes, 22-almost primes, 25-almost primes, 26-almost primes, ...]

A114944 a(n) = prime(n) + semiprime(n) + 3almostprime(n) + 4almostprime(n).

Original entry on oeis.org

30, 45, 68, 77, 106, 112, 128, 164, 176, 188, 204, 223, 243, 273, 286, 304, 319, 328, 350, 372, 385, 424, 439, 459, 479, 496, 511, 529, 544, 553, 580, 596, 626, 632, 668, 692, 730, 742, 753, 771, 781, 793, 823, 838, 857, 870, 887, 909, 929, 938, 974, 999

Offset: 1

Jonathan Vos Post, Feb 20 2006

Primes in this sequence include a(12) = 223, a(23) = 439, a(25) = 479, a(43) = 823, a(45) = 857, a(47) = 887, a(49) = 929.

			a(1) = prime(1) + semiprime(1) + 3almostprime(1) + 4almostprime(1) = 2 + 4 + 8 + 16 = 30.
a(6) = (prime(6) + semiprime(6) + 3almostprime(6)) + 4almostprime(6) = A114382(6) + 4almostprime(6) = 56 + 56 = 112.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A000040, A001358, A014612, A014613, A114382.

AlmostPrimePi[k_Integer, n_] := Module[{a, i}, a[0] = 1; If[k == 1, PrimePi[n], Sum[PrimePi[n/Times @@ Prime[ Array[a, k - 1]]] - a[k - 1] + 1, Evaluate[ Sequence @@ Table[{a[i], a[i - 1], PrimePi[(n/Times @@ Prime[Array[a, i - 1]])^(1/(k - i + 1))]}, {i, k - 1}]] ]]]; (* Eric W. Weisstein, Feb 07 2006 *)
AlmostPrime[k_, n_] := Block[{e = Floor[Log[2, n]], a, b}, a = 2^e; Do[b = 2^p; While[AlmostPrimePi[k, a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2]; Table[ Sum[ AlmostPrime[k, n], {k, 4}], {n, 52}] (* Robert G. Wilson v, Feb 21 2006 *)
nn=500;Module[{p=Prime[Range[nn]],p2=Select[Range[nn], PrimeOmega[#] == 2&], p3=Select[Range[nn], PrimeOmega[#] ==3&],p4 =Select[Range[nn], PrimeOmega[#]==4&],len},len=Min[Length/@{p,p2,p3,p4}];Total/@Thread[ {Take[p,len],Take[p2,len],Take[p3,len],Take[p4,len]}]] (* Harvey P. Dale, Jul 13 2012 *)

a(n) = A000040(n) + A001358(n) + A014612(n) + A014613(n).

a(n) = A014613(n) + A114382(n).

Corrected by Harvey P. Dale, Jul 13 2012

A118779 Determinant of n X n matrix containing the first n^2 4-almost primes in increasing order.

Original entry on oeis.org

16, -224, 0, 182016, 12734992, -80430368, -125120640, 1334967760, 1060202222660, -2759409121760, 54820105989504, -14148083510835712, 49989643415528010, 299304923505836144, 1713123391839442498, 93227182153040103540, -86403659709730762670

Offset: 1

Jonathan Vos Post, May 22 2006

4-almost prime analog of A067276 Determinant of n X n matrix containing the first n^2 primes in increasing order. The first column contains the first n 4-almost primes (A014613) in increasing order, the second column contains the next n 4-almost primes in increasing order, etc. Equivalently, first row contains first n 4-almost primes in increasing order, second row contains next n 4-almost primes in increasing order, etc. See also: A118713 a(n) = semiprime circulant.

			a(2) = -224 because of the determinant -224 =
|16, 24|
|36, 40|.
a(3) = 0 because this matrix is singular: 0 =
|16, 24, 36|
|40, 54, 56|
|60, 81, 84|.
a(6) = -80430368 because of the determinant -80430368 =
| 16, 24, 36, 40, 54, 56|
| 60, 81, 84, 88, 90, 100|
| 104, 126, 132, 135, 136, 140|
| 150, 152, 156, 184, 189, 196|
| 198, 204, 210, 220, 225, 228|
| 232, 234, 248, 250, 260, 276|.
a(8) = 1334967760 =
| 16, 24, 36, 40, 54, 56, 60, 81|
| 84, 88, 90, 100, 104, 126, 132, 135|
|136, 140, 150, 152, 156, 184, 189, 196|
|198, 204, 210, 220, 225, 228, 232, 234|
|248, 250, 260, 276, 294, 296, 297, 306|
|308, 315, 328, 330, 340, 342, 344, 348|
|350, 351, 364, 372, 375, 376, 380, 390|
|414, 424, 441, 444, 459, 460, 462, 472|.

Cf. A014613, A118713, A067276, A118770, A118772.

FourAlmostPrimePi[n_] := Sum[PrimePi[n/(Prime@i*Prime@j*Prime@k)] - k + 1, {i, PrimePi[n^(1/4)]}, {j, i, PrimePi[(n/Prime@i)^(1/3)]}, {k, j, PrimePi@Sqrt[n/(Prime@i*Prime@j)]}]; FourAlmostPrime[n_] := Block[{e = Floor[Log[2, n] + 1], a, b}, a = 2^e; Do[b = 2^p; While[FourAlmostPrimePi[a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2]; Table[Det[Partition[Array[FourAlmostPrime, n^2], n]], {n, 17}] (* Robert G. Wilson v, May 26 2006 *)

More terms from Robert G. Wilson v, May 26 2006

cp's OEIS Frontend

A125149 a(n) is the least k such that the n-almost prime count is positive and equal to the (n-1)-almost prime count. a(0) = 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A112314 Number of partitions of n into products of 4 primes.

Views

Author

Keywords

Examples

Links

Crossrefs

A114414 Records in 4-almost prime gaps ordered by merit.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

A146295 Integers which are not the sum of a 4-almost prime and a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A180150 Numbers n such that n and n+2 are both divisible by exactly 4 primes (counted with multiplicity).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A207790 Permutation of positive numbers. See comments.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A076578 Triangular numbers which are 4-almost primes.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A110893 Numbers with a semiprime number of prime divisors (counted with multiplicity).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs