The MacMahon sequence starts at . At each subsequent step it appends the least positive integer absent from the consecutive sums of the existing sequence. In particular every positive integer eventually has a consecutive-sum representation. Andrews conjectured . Erdős repeated the conjecture and asked whether the growth is superlinear and subpolynomial relative to linear growth. The problem archive credits Porubský with a pointwise lower bound for the counting function along a subsequence, namely . I found no resolution of Andrews's asymptotic. Andrews (1975) · Erdős (1977), p. 70 · Erdős Problems wiki, #359 · OEIS A002048 · Research issue
A lower bound for the reciprocal sum on every scale
Let be any increasing sequence of positive integers such that all sufficiently large integers are sums of consecutive terms of . Then
More locally, uniformly for ,
The constants may depend on the finite number of exceptions to coverage. The proof uses only coverage and strictly increasing positive integer terms. Moser uses the related count of windows by length for the sequence of ordinary primes. The problem archive's summary of Porubský's paper records the pointwise limsup but gives no statement about (1) or (2). I could not obtain that paper's full text to check priority for these estimates. Moser (1963), p. 159 · Bibliographic record of Porubský's results
Proof
Write for the number of consecutive blocks of whose sum is at most , including blocks with one term. Coverage implies . A block of length starting at has sum at least both and . Define and
The weight is positive. For a fixed starting term , integrating the upper bound given by against on gives at most . To bound this, put and split at . Then
For the first two terms, sum the decreasing function for using the first term and its integral. For the last term, use and . The final inequality follows from
Only matter on . The lower bound from coverage and integration by parts gives
Combining the per-start upper bounds proves (1). For (2), integrate over . The starting terms at most are at most in number and each permits at most lengths. Thus their aggregate contribution to the integral is at most
The lower bound from coverage is , with the boundary terms estimated by at . Apply the same per-start bound for the remaining terms to obtain (2).
The mean representation count under the conjectured asymptotic
Suppose more generally that for some . Its counting function then satisfies . Put for the maximum length of a block of sum at most . The initial block has the smallest sum among blocks of each length, so is the largest index for which . Partial summation and asymptotic inversion give
For a fixed length , at most blocks have sum at most , since each such block starts at a term at most . At least do, since all blocks of length ending at a term at most qualify. Summing yields
The integral comparison for the sum over lengths uses the monotonicity of , with error at most . In the integral, , so uniformly in the range and . At Andrews's predicted , the mean number of representations is therefore asymptotic to . Recovering the density of the integers with zero representations using blocks of length at least two requires more information about the multiplicities. The mean alone leaves that density undetermined.