OFFSET
1,2
COMMENTS
When computing a(n) for n > 2, there may be candidates for different values of k; we choose the candidate that minimizes k.
This sequence can also be seen as an irregular table, with first row (1, 2), and for n > 1, the n-th row corresponds to the divisors of the sum of the first n terms not yet in the sequence in ascending order (and the sum of the first n terms is the last term of the n-th row).
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program for A328443
FORMULA
a(n) <= Sum_{k = 1..n-1} a(k) for any n > 2.
EXAMPLE
The table begins:
1, 2;
3;
6;
4, 12;
8, 16;
7, 14, 28;
9, 18, 36;
...
PROG
(PARI) \\ See Links section.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Rémy Sigrist, Oct 15 2019
STATUS
approved