The Frobenius number for sequences of triangular numbers associated with number of solutions (Q2674372)

Let \(a_1,\ldots,a_k\) be positive coprime integers. For a given nonnegative integer \(p\) denote by \(g(a_1,\ldots,a_k;p)\) the largest integer \(N\) such that the number of solutions of the equation \(a_1x_1+\ldots+a_kx_k=N\) in nonnegative integers \(x_1,\ldots,x_k\) is at most \(p\). Let \(t_n=\binom{n}{2}\) be \(n\)-th triangular number. Then formulae for \(g(t_n,t_{n+1},t_{n+2};p)\) for \(p\leq 10\) are found. Also it is proved that for any even \(n\) \[ g\left(t_n,t_{n+1},t_{n+2};p(p+1)+\sum_{j=1}^p\left\lceil \frac{6j}{n}\right\rceil\right)= \frac{(n+1)(n+2)(2(n+3)p+3n}{4}-1 \] and for any odd \(n\geq 3\) \[ g\left(t_n,t_{n+1},t_{n+2};p(p+1)+\sum_{j=1}^p\left\lceil \frac{j}{2}\left( 1+\frac{3}{n}\right) \right\rceil\right)= \frac{(n+1)(n+2)((n+3)p+3(n-1)}{4}-1. \]