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!)
A162528 Numbers k whose largest divisor <= sqrt(k) equals 8. 19

%I #12 Feb 27 2019 02:50:38

%S 64,72,80,88,96,104,112,128,136,152,184,232,248,296,328,344,376,424,

%T 472,488,536,568,584,632,664,712,776,808,824,856,872,904,1016,1048,

%U 1096,1112,1192,1208,1256,1304,1336,1384,1432,1448,1528,1544,1576,1592,1688

%N Numbers k whose largest divisor <= sqrt(k) equals 8.

%C See A161344 for more information.

%F Numbers k such that A033676(k)=8.

%p A033676 := proc(n) local dvs; dvs := sort(convert(numtheory[divisors](n),list)) ; op(floor((nops(dvs)+1)/2) ,dvs) ; end: for n from 1 to 2000 do if A033676(n) = 8 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009

%t ld8Q[n_]:=Last[Select[Divisors[n],#<=Sqrt[n]&]]==8; Select[Range[ 2000], ld8Q] (* _Harvey P. Dale_, Apr 08 2017 *)

%Y Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162526, A162527, A162529, A162530, A162531, A162532.

%K easy,nonn

%O 1,1

%A _Omar E. Pol_, Jul 05 2009

%E More terms from _R. J. Mathar_, Jul 13 2009

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 September 12 23:44 EDT 2024. Contains 375855 sequences. (Running on oeis4.)