Effectiveness of Hindman's theorem for bounded sums

We consider the strength and effective content of restricted versions of Hindman’s Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let ${\mathsf{H}\mathsf{T}}_k^{\le n}$ denote the assertion that for each $k$-coloring $c$ of $\mathbb{N}$ there is an infinite set $X\subseteq \mathbb{N}$ such that all sums ${\sum }_{x\in F}x$ for $F \subseteq X$and$0 < |F| \leq n$ have the same color. We prove that there is a computable $2$-coloring $c$ of $\mathbb{N}$ such that there is no infinite computable set $X$ such that all nonempty sums of at most $2$ elements of $X$ have the same color. It follows that ${\mathsf{H}\mathsf{T}}_2^{\le 2}$ is not provable in ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$ and in fact we show that it implies ${\mathsf{S}\mathsf{R}\mathsf{T}}_2^2$ in ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$. We also show that there is a computable instance of ${\mathsf{H}\mathsf{T}}_3^{\le 3}$ with all solutions computing $0^{\mathrm{\prime }}$. The proof of this result shows that ${\mathsf{H}\mathsf{T}}_3^{\le 3}$ implies ${\mathsf{A}\mathsf{C}\mathsf{A}}_0$ in ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$.