OFFSET
1,2
COMMENTS
Suppose that the initial terms (b(1), ..., b(n)) are chosen such that for each b(k) <= n, the arithmetic mean of the first b(k) terms is exactly b(k). Then the following terms b(n+1), ..., b(b(n)) can be split into parts, the sums of which are fixed. Greedily choose the terms so that for each part, the last term is as small as possible. If the monotonicity still cannot be satisfied, the initial terms are invalid. Otherwise, we can fill the remaining terms with b(k) = 2*k - 1, forming a mean-central sequence.
LINKS
Art of Problem Solving, European Girls' Mathematical Olympiad 2025 Problem 2
Yifan Xie, Python program
EXAMPLE
For n = 4, the 3 valid choices for the first 4 terms of a central sequence are (1, 3, 5, 6), (1, 3, 5, 7) and (1, 4, 5, 6).
(1, 3, 5, 6, 10, 11, 13, 15, ...), (1, 3, 5, 7, 9, ...) and (1, 4, 5, 6, 9, 11, 13, ...) are the corresponding continuations.
Although the initial terms meet the requirement, (1, 3, 5, 8) is invalid because for the arithmetic mean of the first 5 terms to be 5, b(5) must be 8, breaking the monotonicity.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Yifan Xie, Apr 19 2025
EXTENSIONS
Definition edited by N. J. A. Sloane, Apr 29 2025
STATUS
approved
