login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132657 a(n) is the product of the least prime > n^2 and the greatest prime < (n+1)^2. 2

%I #18 Aug 27 2022 18:31:44

%S 6,35,143,391,899,1739,3233,5293,8051,11413,17653,24883,33389,43931,

%T 56977,72731,92881,118829,145699,176039,212197,254701,308911,357163,

%U 424663,492179,566609,660293,756611,864371,987307,1120697,1257923

%N a(n) is the product of the least prime > n^2 and the greatest prime < (n+1)^2.

%H Robert Israel, <a href="/A132657/b132657.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A007491(n) * A053001(n+1).

%e a(1) = 6 = 2*3 = (smallest prime in [1^2,2^2]) * (largest prime in [1^2,2^2]).

%e a(2) = 35 = 5*7 = (smallest prime in [2^2,3^2]) * (largest prime in [2^2,3^2]).

%p seq(nextprime(n^2)*prevprime((n+1)^2,n=1..100); # _Robert Israel_, Jan 26 2020

%t Table[Prime[PrimePi[n^2] + 1]*Prime[PrimePi[(n + 1)^2]], {n, 1, 40}] (* _Stefan Steinerberger_, Nov 20 2007 *)

%t NextPrime[#[[1]]]NextPrime[#[[2]],-1]&/@Partition[Range[40]^2,2,1] (* _Harvey P. Dale_, Aug 27 2022 *)

%o (PARI) for(n=1,33,print1(nextprime(n^2)*precprime((n+1)^2),", ")) \\ _Hugo Pfoertner_, Jan 26 2020

%Y Cf. A000040, A001358, A007491, A014085, A053000, A053001, A053607, A077766, A077767, A132435.

%K easy,nonn

%O 1,1

%A _Jonathan Vos Post_, Nov 15 2007

%E More terms from _Stefan Steinerberger_, Nov 20 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)