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!)
A196302 Smallest highly composite number that is not a divisor of n-th highly composite number or 0 if no such number exists. 0

%I #7 Aug 03 2014 14:01:34

%S 0,0,0,4,0,0,24,36,24,36,24,36,48,0,36,24,36,48,0,48,7560,10080,7560,

%T 7560,48,10080,7560,7560,48,7560,10080,7560,7560,20160,10080,7560,

%U 25200,7560,48,7560,10080,7560,7560,20160,10080,7560,25200,10080,7560,25200

%N Smallest highly composite number that is not a divisor of n-th highly composite number or 0 if no such number exists.

%C a(19) is the last 0 in this sequence

%e a(4) = 4 because 6, the fourth highly composite number, is a multiple of 1 and 2 but not of 4. a(5) = 0 because 12 is a multiple of all of 1, 2, 4, 6, and 12.

%t (* let hc contain consecutive highly composite numbers starting with 1 *) Table[i = 1; While[i < n && Mod[hc[[n]], hc[[i]]] == 0, i++]; If[i == n, 0, hc[[i]]], {n, Length[hc]}] (* _T. D. Noe_, Sep 30 2011 *)

%Y Cf A002182.

%K nonn

%O 1,4

%A _J. Lowell_, Sep 30 2011

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