OFFSET
1,2
COMMENTS
Also positions of records in A331284.
a(n) is the least k such that in range 1 .. k of A329605 (equally: in A329606[1..k]) there can be found exactly n occurrences of some term. In A329605 these "champion terms" are A329605(a(n)): 1, 4, 16, 24, 48, 192, 96, 192, 384, 288, 288, 576, 576, 576, 1152, 2304, 4608, 9216, 576, 2304, ..., that appear all to be 3-smooth numbers (in A003586).
FORMULA
A331284(a(n)) = n for all n >= 1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 14 2020
STATUS
approved