cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A331200 Least number with each record number of factorizations into distinct factors > 1.

This page as a plain text file.
%I A331200 #12 Jan 17 2020 14:01:01
%S A331200 1,6,12,24,48,60,96,120,180,240,360,480,720,840,1080,1260,1440,1680,
%T A331200 2160,2520,3360,4320,5040,7560,8640,10080,15120,20160,25200,30240,
%U A331200 40320,45360,50400,55440,60480,75600,90720,100800,110880,120960,151200,181440,221760
%N A331200 Least number with each record number of factorizations into distinct factors > 1.
%C A331200 First differs from A330997 in lacking 64.
%H A331200 Giovanni Resta, <a href="/A331200/b331200.txt">Table of n, a(n) for n = 1..122</a>
%H A331200 Jun Kyo Kim, <a href="https://doi.org/10.1006/jnth.1998.2238">On highly factorable numbers</a>, Journal Of Number Theory, Vol. 72, No. 1 (1998), pp. 76-91.
%e A331200 Strict factorizations of the initial terms:
%e A331200   ()  (6)    (12)   (24)     (48)     (60)      (96)      (120)
%e A331200       (2*3)  (2*6)  (3*8)    (6*8)    (2*30)    (2*48)    (2*60)
%e A331200              (3*4)  (4*6)    (2*24)   (3*20)    (3*32)    (3*40)
%e A331200                     (2*12)   (3*16)   (4*15)    (4*24)    (4*30)
%e A331200                     (2*3*4)  (4*12)   (5*12)    (6*16)    (5*24)
%e A331200                              (2*3*8)  (6*10)    (8*12)    (6*20)
%e A331200                              (2*4*6)  (2*5*6)   (2*6*8)   (8*15)
%e A331200                                       (3*4*5)   (3*4*8)   (10*12)
%e A331200                                       (2*3*10)  (2*3*16)  (3*5*8)
%e A331200                                                 (2*4*12)  (4*5*6)
%e A331200                                                           (2*3*20)
%e A331200                                                           (2*4*15)
%e A331200                                                           (2*5*12)
%e A331200                                                           (2*6*10)
%e A331200                                                           (3*4*10)
%e A331200                                                           (2*3*4*5)
%t A331200 nn=1000;
%t A331200 strfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[strfacs[n/d],Min@@#>d&]],{d,Rest[Divisors[n]]}]];
%t A331200 qv=Table[Length[strfacs[n]],{n,nn}];
%t A331200 Table[Position[qv,i][[1,1]],{i,Union[qv//.{foe___,x_,y_,afe___}/;x>y:>{foe,x,afe}]}]
%Y A331200 A subset of A330997.
%Y A331200 All terms belong to A025487.
%Y A331200 This is the strict version of highly factorable numbers A033833.
%Y A331200 The corresponding records are A331232(n) = A045778(a(n)).
%Y A331200 Factorizations are A001055 with image A045782 and complement A330976.
%Y A331200 Strict factorizations are A045778 with image A045779 and complement A330975.
%Y A331200 The least number with n strict factorizations is A330974(n).
%Y A331200 The least number with A045779(n) strict factorizations is A045780(n)
%Y A331200 Cf. A045783, A325238, A330972, A330973, A331023/A331024, A331201.
%K A331200 nonn
%O A331200 1,2
%A A331200 _Gus Wiseman_, Jan 12 2020
%E A331200 a(37) and beyond from _Giovanni Resta_, Jan 17 2020