A000879 -id:A000879 - cp's OEIS frontend

A083270 Duplicate of A000879.

2, 4, 9, 15, 30, 39, 61, 72, 99, 146, 162, 219, 263, 283, 329, 409, 487, 519, 609, 675

Offset: 1

dead

A052180 Last filtering prime for n-th prime p: find smallest prime factor of each of the composite numbers between p and next prime; take maximal value.

2, 2, 3, 2, 3, 2, 3, 5, 2, 5, 3, 2, 3, 7, 5, 2, 5, 3, 2, 7, 3, 5, 7, 3, 2, 3, 2, 3, 11, 3, 7, 2, 11, 2, 5, 7, 3, 13, 5, 2, 11, 2, 3, 2, 11, 13, 3, 2, 3, 5, 2, 13, 11, 7, 5, 2, 5, 3, 2, 17, 13, 3, 2, 3, 17, 5, 11, 2, 3, 5, 19, 7, 13, 3, 5, 17, 3, 13, 7, 2, 7, 2, 19, 3, 5, 11, 3, 2, 3, 11, 13, 3, 17

Offset: 2

Labos Elemer, Feb 05 2000

A000879(n) is the least index i such that a(i) = prime(n). - Labos Elemer, May 14 2003

			For n=9, n-th prime is 23, composites between 23 and next prime are 24 25 26 27 28, smallest prime divisors are 2 5 2 3 2; maximal value is 5, so a(9)=5.

T. D. Noe, Table of n, a(n) for n=2..10000

Cf. A052248, A020639, A000720, A083269, A000879.

Cf. A010051.

a052180 n = a052180_list !! (n-2)
a052180_list = f [4..] where
   f ws = (maximum $ map a020639 us) : f vs where
     (us, _:vs) = span  ((== 0) . a010051) ws
-- Reinhard Zumkeller, Dec 27 2012

ffi[x_] := Flatten[FactorInteger[x]];
lf[x_] := Length[FactorInteger[x]];
ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}];
mi[x_] := Min[ba[x]];
Table[Max[Table[mi[ba[w]], {w, Prime[j]+1, -1+Prime[j+1]}]], {j, 2, 256}]
(* Second program: *)
mpf[{a_,b_}] := Max[FactorInteger[#][[1,1]]& /@ Range[a+1,b-1]];
mpf/@ Partition[ Prime[Range[2,100]],2,1] (* Harvey P. Dale, Apr 30 2013 *)

a(n) = {my(p = prime(n), amax = 0); forcomposite(c = p, nextprime(p+1), amax = max(factor(c)[1,1], amax);); amax;} \\ Michel Marcus, Apr 21 2018

from sympy import prime, nextprime, primefactors
def a(n):
  p = prime(n); q = nextprime(p)
  return max(min(primefactors(m)) for m in range(p+1, q))
print([a(n) for n in range(2, 95)]) # Michael S. Branicky, Feb 02 2021

a(n) = Max_{j=1+prime(n)..prime(n+1)-1} A020639(j) where A020639(j) is the least prime dividing j.

A050216 Number of primes between (prime(n))^2 and (prime(n+1))^2, with a(0) = 2 by convention.

Original entry on oeis.org

2, 2, 5, 6, 15, 9, 22, 11, 27, 47, 16, 57, 44, 20, 46, 80, 78, 32, 90, 66, 30, 106, 75, 114, 163, 89, 42, 87, 42, 100, 354, 99, 165, 49, 299, 58, 182, 186, 128, 198, 195, 76, 356, 77, 144, 75, 463, 479, 168, 82, 166, 270, 90, 438, 275, 274, 292, 91, 292, 199, 99

Offset: 0

Eric W. Weisstein

The function in Brocard's Conjecture, which states that for n >= 2, a(n) >= 4.
The lines in the graph correspond to prime gaps of 2, 4, 6, ... . - T. D. Noe, Feb 04 2008
Lengths of blocks of consecutive primes in A000430 (union of primes and squares of primes). - Reinhard Zumkeller, Sep 23 2011
In the n-th step of the sieve of Eratosthenes, all multiples of prime(n) are removed. Then a(n) gives the number of new primes obtained after the n-th step. - Jean-Christophe Hervé, Oct 27 2013
More precisely, after the n-th step, one is sure to have eliminated all composites less than prime(n+1)^2, since any composite N has a prime factor <= sqrt(N). It is in exactly this (restricted) sense that a(n) yields the number of "new primes" (additional numbers known to be prime) after the n-th step. But one knows after the n-th step also that all remaining numbers between prime(n+1)^2 and prime(n+1)*(prime(n+1)+2) are prime: By construction they don't have a factor less than prime(n+1) and they don't have a factor prime(n+1) so the least prime factor could be prime(n+2) >= prime(n+1)+2. For example, after eliminating multiples of 3 in the 2nd step, one has (2, 3, 5, 7, 11, 13, 17, 23, 25, 29, 31, 35, ...) and one knows that all remaining numbers strictly in between 5^2=25 and 5*(5+2)=35 are prime, too. - M. F. Hasler, Dec 31 2014
Numerically, the slope of the lowest "ray" m(n) = min {a(k); k>n}, seems to converge to a value somewhere in the range 1.75 < m(n)/n < 1.8; with m(n)/n > 1.7 for n > 900, m(n)/n > 1.75 for n > 2700. - M. F. Hasler, Dec 31 2014
Legendre's conjecture (see A014085) would imply that a(n) >= 2 for all n and that sequences A054272, A250473 and A250474 were thus strictly increasing (see the Wikipedia article about Brocard's conjecture). - Antti Karttunen, Jan 01 2015
a(n) >= 4 up to at least n = 4*10^5. - Eric W. Weisstein, Jan 13 2025

			There are 2 primes less than 2^2, there are 2 primes between 2^2 and 3^2, 5 primes between 3^2 and 5^2, etc. [corrected by Jonathan Sperry, Aug 30 2013]

Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 183.

T. D. Noe, Table of n, a(n) for n = 0..10000
Joel E. Cohen, Conjectures about Primes and Cyclic Numbers, arXiv:2508.08335 [math.NT], 2025. See p. 16.
Anthony G. Shannon and Jean V. Leyendekkers, On Legendre's Conjecture, Notes on Number Theory and Discrete Mathematics, Vol. 23, No. 2 (2017): 117-125.
Nicolas Vaillant, Graph of A050216(n) / (n * A001223(n))
Nicolas Vaillant, Average density of primes between prime(n)^2 and prime(n+1)^2
Eric Weisstein's World of Mathematics, Brocard's Conjecture.
Wikipedia, Brocard's Conjecture

First differences of A000879.
One more than A251723.
Cf. A010051, A001248, A014085, A089609, A251719, A256468, A256469, A256470, A029707, A137859.
Cf. A380135 (High water marks for number of primes between prime(n)^2 and prime(n+1)^2).
Cf. A380136 (Positions of the high water marks for number of primes between prime(n)^2 and prime(n+1)^2).

import Data.List (group)
a050216 n = a050216_list !! (n-1)
a050216_list =
   map length $ filter (/= [0]) $ group $ map a010051 a000430_list
-- Reinhard Zumkeller, Sep 23 2011

A050216 := proc(n)
    local p,pn ;
    if n = 0 then
        2;
    else
        p := ithprime(n) ;
        pn := nextprime(p) ;
        numtheory[pi](pn^2)-numtheory[pi](p^2) ;
    end if;
end proc:
seq(A050216(n),n=0..40) ; # R. J. Mathar, Jan 27 2025

-Subtract @@@ Partition[PrimePi[Prime[Range[20]]^2], 2, 1] (* Eric W. Weisstein, Jan 10 2025 *)

a(n)={n||return(2);primepi(prime(n+1)^2)-primepi(prime(n)^2)} \\ M. F. Hasler, Dec 31 2014

For all n >= 1, a(n) = A256468(n) + A256469(n). - Antti Karttunen, Mar 30 2015

Limit_{N->oo} (Sum_{n=1..N} a(n)) / (Sum_{n=1..N} prime(n)) = 1. - Alain Rocchelli, Sep 30 2023

Edited by N. J. A. Sloane, Nov 15 2009

A250474 Number of times prime(n) occurs as the least prime factor among numbers 1 .. prime(n)^3: a(n) = A078898(A030078(n)).

Original entry on oeis.org

4, 5, 9, 14, 28, 36, 57, 67, 93, 139, 154, 210, 253, 272, 317, 396, 473, 504, 593, 658, 687, 792, 866, 979, 1141, 1229, 1270, 1356, 1397, 1496, 1849, 1947, 2111, 2159, 2457, 2514, 2695, 2880, 3007, 3204, 3398, 3473, 3828, 3904, 4047, 4121, 4583, 5061, 5228, 5309, 5474, 5743, 5832, 6269, 6543, 6816, 7107, 7197, 7488, 7686, 7784, 8295, 9029, 9248, 9354, 9568, 10351

Offset: 1

Antti Karttunen, Nov 23 2014

nonn

Position of the first composite number (which is always 4) on row n of A249821. The fourth column of A249822.
Position of the first nonfixed term on row n of arrays of permutations A251721 and A251722.
According to the definition, this is the number of multiples of prime(n) below prime(n)^3 (and thus, the number of numbers below prime(n)^2) which do not have a smaller factor than prime(n). That is, the numbers remaining below prime(n)^2 after deleting all multiples of primes less than prime(n), as is done by applying the first n-1 steps of the sieve of Eratosthenes (when the first step is elimination of multiples of 2). This explains that the first differences are a(n+1)-a(n) = A050216(n)-1 for n>1, and a(n) = A054272(n)+2. - M. F. Hasler, Dec 31 2014

			prime(1) = 2 occurs as the least prime factor in range [1,8] for four times (all even numbers <= 8), thus a(1) = 4.
prime(2) = 3 occurs as the least prime factor in range [1,27] for five times (when n is: 3, 9, 15, 21, 27), thus a(2) = 5.

Antti Karttunen, Table of n, a(n) for n = 1..5001

One more than A250473. Two more than A054272.
Column 4 of A249822.
Cf. also A250477 (column 6), A250478 (column 8).
Cf. A000040, A000879, A001248, A002110, A005867, A008683, A008836, A020639, A030078, A055396, A078898, A249821, A251721, A251722.

f[n_] := Count[Range[Prime[n]^3], x_ /; Min[First /@ FactorInteger[x]] == Prime@ n]; Array[f, 16] (* Michael De Vlieger, Mar 30 2015 *)

A250474(n) = 3 + primepi(prime(n)^2) - n; \\ Fast implementation.
for(n=1, 5001, write("b250474.txt", n, " ", A250474(n)));
\\ The following program reflects the given sum formula, but is far from the optimal solution:
allocatemem(234567890);
A002110(n) = prod(i=1, n, prime(i));
A020639(n) = if(1==n,n,vecmin(factor(n)[,1]));
A055396(n) = if(1==n,0,primepi(A020639(n)));
A250474(n) = { my(p2 = prime(n)^2); sumdiv(A002110(n-1), d, moebius(d)*(p2\d)); };
for(n=1, 23, print1(A250474(n),", "));

(define (A250474 n) (let loop ((k 2)) (if (not (prime? (A249821bi n k))) k (loop (+ k 1))))) ;; This is even slower. Code for A249821bi given in A249821.

a(n) = 3 + A000879(n) - n = A054272(n) + 2 = A250473(n) + 1.
a(n) = A078898(A030078(n)).
a(1) = 1, a(n) = Sum_{d|A002110(n-1)} moebius(d)*floor(prime(n)^2/d). [Follows when A030078(n), prime(n)^3 is substituted to the similar formula given for A078898(n). Here A002110(n) gives the product of the first n primes. Because the latter is always squarefree, one could use also Liouville's lambda (A008836) instead of Moebius mu (A008683)].
Other identities. For all n >= 1:
A249821(n, a(n)) = 4.

A054272 Number of primes in the interval [prime(n), prime(n)^2].

Original entry on oeis.org

2, 3, 7, 12, 26, 34, 55, 65, 91, 137, 152, 208, 251, 270, 315, 394, 471, 502, 591, 656, 685, 790, 864, 977, 1139, 1227, 1268, 1354, 1395, 1494, 1847, 1945, 2109, 2157, 2455, 2512, 2693, 2878, 3005, 3202, 3396, 3471, 3826, 3902, 4045, 4119, 4581, 5059

Offset: 1

Labos Elemer, May 05 2000

nonn

These primes are candidates for fortunate numbers (A005235).
These are precisely the primes available for the solution of Aguilar's conjecture or Haga's conjecture in Carlos Rivera's The Prime Puzzles and Problems Connection, (conjecture 26). Aguilar's conjecture states that at least one prime will be available for placement on each row and column of a p X p square array. Haga's conjecture states that just p primes are required for such placement in any p X p array. - Enoch Haga, Jan 23 2002
Also number of times p_n (the n-th prime) occurs as the least prime factor (A020639) among numbers in range [(p_n)+1, ((p_n)^3)-1]. For n=1, p_1 = 2 and there are two even numbers in range [3, 7], namely 4 and 6, so a(1) = 2. See also A250474. - Antti Karttunen, Dec 05 2014
The number of consecutive primes after the leading 1 in the prime(n)-rough numbers. - Benedict W. J. Irwin, Mar 24 2016

			n=4, the zone in question is [7,49] and encloses a(4)=12 primes, as follows: {7,11,13,17,19,23,29,31,37,41,43,47}.

Antti Karttunen, Table of n, a(n) for n = 1..5000
Carlos Rivera, Conjecture 26. The Calendar-like square Conjecture, The Prime Puzzles and Problems Connection.

One less than A250473, two less than A250474.
First differences: A251723.
Cf. A000040, A000879, A001248, A002110, A005235, A005867, A008683, A008836, A020639, A078898, A249747.

a[n_] := PrimePi[Prime[n]^2] - n + 1; Array[a, 50] (* Jean-François Alcover, Dec 07 2015 *)

\\ A fast version:
default(primelimit, 2^31 + 2^30);
A054272(n) = 1 + primepi(prime(n)^2) - n;
for(n=1, 5000, write("b054272.txt", n, " ", A054272(n)));
\\ The following mirrors the given new formula. It is far from an optimal way to compute this sequence:
allocatemem(234567890);
A002110(n) = prod(i=1, n, prime(i));
A054272(n) = { my(p2); p2 = prime(n)^2; sumdiv(A002110(n), d, moebius(d)*floor(p2/d)); };
for(n=1, 22, print1(A054272(n),", ")); \\ Antti Karttunen, Dec 05 2014

a(n) = A000879(n) - n + 1.
From Antti Karttunen, Dec 05-08 2014: (Start)
a(n) = A250473(n) - 1 = A250474(n) - 2.
a(n) = sum_{d | A002110(n)} moebius(d) * floor((p_n)^2 / d). [Where p_n is the n-th prime (A000040(n)) and A002110(n) gives the product of the first n primes. Because the latter is always squarefree, one could also use Liouville's lambda (A008836) instead of Moebius mu (A008683).]
The ratio (a(n) * A002110(n)) / (A001248(n) * A005867(n)) stays near 1, which follows from the above summation formula. See also A249747.
(End)

A054270 Largest prime below prime(n)^2 (A001248).

Original entry on oeis.org

3, 7, 23, 47, 113, 167, 283, 359, 523, 839, 953, 1367, 1669, 1847, 2207, 2803, 3469, 3719, 4483, 5039, 5323, 6229, 6883, 7919, 9403, 10193, 10607, 11447, 11867, 12763, 16127, 17159, 18757, 19319, 22193, 22787, 24631, 26561, 27883, 29927, 32029

Offset: 1

Labos Elemer, May 05 2000

nonn

For n > 1, the n-1 first primes determine the primes up to a(n). This is how the Sieve of Eratosthenes works. - Jean-Christophe Hervé, Oct 21 2013

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A000040, A000879, A001248, A054271.

seq(prevprime(ithprime(i)^2),i=1..100); # Robert Israel, May 04 2020

NextPrime[Prime[Range[50]]^2,-1] (* Harvey P. Dale, May 19 2016 *)

a(n) = precprime(prime(n)^2); \\ Michel Marcus, Dec 13 2013

a(n) = Max[prime q: q < prime(n)^2].

a(n) = prime(A000879(n)) = A000040(A000879(n)). - Jean-Christophe Hervé, Oct 21 2013

A251723 First differences of A054272, A250473 and A250474: a(n) = A054272(n+1) - A054272(n).

Original entry on oeis.org

1, 4, 5, 14, 8, 21, 10, 26, 46, 15, 56, 43, 19, 45, 79, 77, 31, 89, 65, 29, 105, 74, 113, 162, 88, 41, 86, 41, 99, 353, 98, 164, 48, 298, 57, 181, 185, 127, 197, 194, 75, 355, 76, 143, 74, 462, 478, 167, 81, 165, 269, 89, 437, 274, 273, 291, 90, 291, 198, 98, 511, 734, 219, 106, 214, 783, 340, 578, 124, 240, 362, 488, 380, 379, 251, 393, 529, 261, 530, 669, 150, 708, 150

Offset: 1

Antti Karttunen, Dec 15 2014

nonn

Antti Karttunen, Table of n, a(n) for n = 1..5000

One less than A050216, the first differences of A000879.

Cf. A054272, A250473, A250474, A251719, A256446, A256447, A256448, A256449.

a(n) = A054272(n+1) - A054272(n).

a(n) = A256447(n) + A256448(n). [Cf. also A256449.]

A250473 Length of the maximal prefix of noncomposite numbers on row n of A249821.

Original entry on oeis.org

3, 4, 8, 13, 27, 35, 56, 66, 92, 138, 153, 209, 252, 271, 316, 395, 472, 503, 592, 657, 686, 791, 865, 978, 1140, 1228, 1269, 1355, 1396, 1495, 1848, 1946, 2110, 2158, 2456, 2513, 2694, 2879, 3006, 3203, 3397, 3472, 3827, 3903, 4046, 4120, 4582, 5060, 5227, 5308, 5473, 5742, 5831, 6268, 6542, 6815, 7106, 7196, 7487, 7685, 7783, 8294, 9028, 9247, 9353, 9567, 10350

Offset: 1

Antti Karttunen, Nov 23 2014

nonn

a(n) = Length of the initial fixed portion of the permutation at row n of A251721 & A251722.

Also, for n > 1, the length of the maximal increasing prefix on row n of A249821.

One more than A054272.
One less than A250474.
Cf. A000879, A249821, A251721, A251722.

a(n) = A054272(n) + 1.
a(n) = A250474(n) - 1.
a(n) = 2 + A000879(n) - n.

A062772 Smallest prime larger than square of n-th prime.

Original entry on oeis.org

5, 11, 29, 53, 127, 173, 293, 367, 541, 853, 967, 1373, 1693, 1861, 2213, 2819, 3491, 3727, 4493, 5051, 5333, 6247, 6899, 7927, 9413, 10211, 10613, 11467, 11887, 12781, 16139, 17167, 18773, 19333, 22229, 22807, 24659, 26573, 27893, 29947, 32051

Offset: 1

Labos Elemer, Jul 18 2001

Subsequence of A007491. - Zak Seidov, Apr 30 2015

			100th prime, 541 immediately follows 529, square of 9th prime.

Harry J. Smith, Table of n, a(n) for n = 1..1000

Cf. A054270, A054271, A000879.

Cf. A007491. - Zak Seidov, Apr 30 2015

with(numtheory): [seq(nextprime(ithprime(w)^2),w=1..100)];

Array[NextPrime[Prime[#]^2] &, 41] (* Michael De Vlieger, Nov 02 2017 *)

a(n) = { nextprime(prime(n)^2) } \\ Harry J. Smith, Aug 10 2009

a(n) = A007918(A001248(n)) = A151800(A001248(n)). - Michel Marcus, Jun 24 2014

a(n) = A007491(A000040(n)). - Zak Seidov, Apr 30 2015

A000885 Number of twin prime pairs < square of n-th prime.

Original entry on oeis.org

0, 2, 4, 6, 10, 12, 19, 21, 25, 33, 35, 46, 53, 56, 67, 80, 93, 98, 117, 128, 131, 146, 160, 174, 195, 210, 217, 227, 233, 244, 286, 298, 325, 331, 376, 386, 406, 423, 444, 467, 492, 505, 554, 561, 581, 589, 641, 700, 723, 732, 748, 780, 789, 835, 868, 895, 938, 945, 975

Offset: 1

gandalf(AT)hrn.office.ssi.net (James D. Ausfahl)

nonn

Donovan Johnson, Table of n, a(n) for n = 1..10000

Cf. A000879.

With[{tpps=Select[Partition[Prime[Range[10000]],2,1],Last[#]- First[#] == 2&]}, Table[ Count[tpps,?(Last[#]<Prime[n]^2&)],{n,60}]] (* _Harvey P. Dale, Aug 11 2011 *)

More terms from David W. Wilson

cp's OEIS Frontend

A083270 Duplicate of A000879.

Views

Author

Keywords

A052180 Last filtering prime for n-th prime p: find smallest prime factor of each of the composite numbers between p and next prime; take maximal value.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

A050216 Number of primes between (prime(n))^2 and (prime(n+1))^2, with a(0) = 2 by convention.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A250474 Number of times prime(n) occurs as the least prime factor among numbers 1 .. prime(n)^3: a(n) = A078898(A030078(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Scheme

Formula

A054272 Number of primes in the interval [prime(n), prime(n)^2].

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A054270 Largest prime below prime(n)^2 (A001248).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A251723 First differences of A054272, A250473 and A250474: a(n) = A054272(n+1) - A054272(n).

Views

Author

Keywords

Links

Crossrefs

Formula

A250473 Length of the maximal prefix of noncomposite numbers on row n of A249821.