cp's OEIS Frontend

A270308 Numbers which are less than the number of their ordered factorizations.

%I A270308 #20 Apr 11 2020 06:12:15
%S A270308 72,96,120,144,192,216,240,288,336,360,384,432,480,504,540,576,600,
%T A270308 648,672,720,768,840,864,960,1008,1080,1152,1200,1260,1296,1344,1440,
%U A270308 1512,1536,1584,1620,1680,1728,1800,1872,1920,1944,2016,2112,2160,2240,2304,2400
%N A270308 Numbers which are less than the number of their ordered factorizations.
%C A270308 Also numbers which are less than the number of their perfect factorizations or gozinta chains.
%C A270308 The least odd term of this sequence is 51288546684375. - _Amiram Eldar_, Apr 11 2020
%H A270308 Amiram Eldar, <a href="/A270308/b270308.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..100 from Paolo P. Lava)
%F A270308 Solution of the inequation n < A002033(n-1) = A074206(n).
%e A270308 The ordered partitions of 72 are 76, of 96 are 112, of 120 are 132, etc.
%p A270308 P:=proc(q) local a,j,k,m; a:= array(1..q); for k from 1 to q do a[k]:=0 od; a[1]:=1;
%p A270308 for j from 2 to q do for m from 1 to j-1 do if j mod m=0 then a[j]:= a[j]+a[m]; fi; od;
%p A270308 if j<a[j] then print(j); fi; od; end: P(10^5);
%t A270308 f[1] = 1; f[n_] := DivisorSum[n, f[#] &, # < n &]; Select[Range[2400], f[#] > # &] (* _Amiram Eldar_, Apr 11 2020 *)
%Y A270308 Cf. A002033, A074206, A163272.
%K A270308 nonn,easy
%O A270308 1,1
%A A270308 _Paolo P. Lava_, Mar 15 2016