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!)
A084918 Numbers n >= 1000, such that if prime P divides n, then so does each smaller prime. 1

%I #7 Mar 09 2019 19:22:17

%S 1024,1050,1080,1152,1200,1260,1296,1350,1440,1458,1470,1500,1536,

%T 1620,1680,1728,1800,1890,1920,1944,2048,2100,2160,2250,2304,2310,

%U 2400,2430,2520,2592,2700,2880,2916,2940,3000,3072,3150,3240,3360,3456,3600,3750

%N Numbers n >= 1000, such that if prime P divides n, then so does each smaller prime.

%C A055932 lists terms below 1000.

%t espQ[n_]:=Module[{f=FactorInteger[n][[All,1]]},Prime[Range[ PrimePi[ Max[f]]]] == f]; Select[Range[1000,4000],espQ] (* _Harvey P. Dale_, Mar 09 2019 *)

%Y Cf. A055932, A056808, A057335, A066099, A071364, A080259, A080404.

%K easy,nonn

%O 0,1

%A _Alford Arnold_, Jul 15 2003

%E Edited by _Don Reble_, Nov 03 2003

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 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)