OFFSET
1,27
COMMENTS
The greedy sum is also the sum with the minimal number of primorials, used for example in the primorial base representation.
Positions of the records (and conjecturally, the positions of the first occurrences of each n) begin as 1, 8, 27, 162, 289, 529, 841, 1369, 1681, 2209, 2809, 3481, 4489, 5041, 5329, 6889, ..., that after 162 all seem to be squares of certain primes. See also A329051.
LINKS
EXAMPLE
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 11 2019
STATUS
approved