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!)
A152048 Smallest divisor of A002182(n) >= sqrt(A002182(n)) 1

%I #3 Mar 30 2012 19:00:38

%S 1,2,2,3,4,6,6,8,10,12,15,16,20,30,30,36,42,56,72,90,105,126,144,168,

%T 168,216,225,240,297,336,420,480,528,594,720,770,840,858,1080,1232,

%U 1485,1716,1925,2080,2574,2730,2970,3300,3850,4160,4680,5720,6120,6600,7854

%N Smallest divisor of A002182(n) >= sqrt(A002182(n))

%C a(n) = A002182(n) / A152047(n). [From _Klaus Brockhaus_, Nov 27 2008]

%e a(9) = 10 because the ninth highly composite number is 60 and 10 is the smallest divisor of 60 >= sqrt(60). (Although 8 >= sqrt(60), 8 does not qualify because it is not a divisor of 60.)

%Y A152047

%K nonn

%O 1,2

%A _J. Lowell_, Nov 21 2008

%E Extended beyond a(9) by _Klaus Brockhaus_, Nov 27 2008

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 May 3 19:22 EDT 2024. Contains 372222 sequences. (Running on oeis4.)