cp's OEIS Frontend

A081513 a(2)=0; for n != 2, let m = A081512(n), then a(n) = value of d_n in the lexicographically earliest set of n distinct divisors d_1, ..., d_n of m with d_1 + ... + d_n = m.

%I A081513 #30 Oct 24 2024 09:24:28
%S A081513 1,0,3,6,12,8,24,20,28,40,40,30,60,45,60,120,90,72,72,168,240,180,144,
%T A081513 168,168,216,420,315,210,420,420,336,432,1260,840,840,504,504,315,480,
%U A081513 540,2520,2520,1680,1680,1260,1260,1008,720,2520,2520,1890,1512,945,3360
%N A081513 a(2)=0; for n != 2, let m = A081512(n), then a(n) = value of d_n in the lexicographically earliest set of n distinct divisors d_1, ..., d_n of m with d_1 + ... + d_n = m.
%H A081513 David A. Corneth, <a href="/A081513/b081513.txt">Table of n, a(n) for n = 1..552</a>
%e A081513 The lexicographically earliest solutions are:
%e A081513 ..n....m: d_1 d_2 ... d_n
%e A081513 -------------------------
%e A081513 ..1....1: 1
%e A081513 ..2....0: - -
%e A081513 ..3....6: 1, 2, 3
%e A081513 ..4...12: 1, 2, 3, 6
%e A081513 ..5...24: 1, 2, 3, 6, 12
%e A081513 ..6...24: 1, 2, 3, 4, 6, 8
%e A081513 ..7...48: 1, 2, 3, 4, 6, 8, 24
%e A081513 ..8...60: 1, 2, 3, 4, 5, 10, 15, 20
%e A081513 ..9...84: 1, 2, 3, 4, 6, 7, 12, 21, 28
%e A081513 .10..120: 1, 2, 3, 4, 5, 6, 15, 20, 24, 40
%e A081513 ...
%Y A081513 Cf. A081512, A081514.
%Y A081513 See also A081515, A081516, A081517, A081521.
%K A081513 nonn
%O A081513 1,3
%A A081513 _Amarnath Murthy_, Mar 27 2003
%E A081513 Corrected by Caleb M. Shor (cshor(AT)bates.edu), Sep 26 2007
%E A081513 Terms a(8) onwards from _Jinyuan Wang_, May 23 2020
%E A081513 Definition clarified by _N. J. A. Sloane_, May 23 2020, following suggestions from _Jinyuan Wang_.