A081514 Triangle read by rows: row n = lexicographically earliest choice for n distinct divisors of A081512(n) = m whose sum is m.
1, 0, 0, 1, 2, 3, 1, 2, 3, 6, 1, 2, 3, 6, 12, 1, 2, 3, 4, 6, 8, 1, 2, 3, 4, 6, 8, 24, 1, 2, 3, 4, 5, 10, 15, 20, 1, 2, 3, 4, 6, 7, 12, 21, 28, 1, 2, 3, 4, 5, 6, 15, 20, 24, 40, 1, 2, 3, 4, 5, 6, 8, 12, 15, 24, 40, 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 24, 30, 1, 2, 3, 4, 5, 6, 9, 10, 12, 18, 20, 30, 60
Offset: 1
Examples
The lexicographically earliest solutions are: [1] [0, 0] [1, 2, 3] [1, 2, 3, 6] [1, 2, 3, 6, 12] [1, 2, 3, 4, 6, 8] [1, 2, 3, 4, 6, 8, 24] [1, 2, 3, 4, 5, 10, 15, 20] [1, 2, 3, 4, 6, 7, 12, 21, 28] [1, 2, 3, 4, 5, 6, 15, 20, 24, 40] [1, 2, 3, 4, 5, 6, 8, 12, 15, 24, 40] [1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 24, 30] [1, 2, 3, 4, 5, 6, 9, 10, 12, 18, 20, 30, 60] ...
Links
- David A. Corneth, Table of n, a(n) for n = 1..10296
Extensions
Corrected by Caleb M. Shor (cshor(AT)bates.edu), Sep 26 2007
Edited by N. J. A. Sloane, May 24 2020 at the suggestion of Jinyuan Wang, who also gave the first 13 rows.
Comments