B\"uchi's problem asks whether there exists a positive integer $M$ such that
any sequence $(x_n)$ of at least $M$ integers, whose second difference of
squares is the constant sequence $(2)$, satisifies $x_n^2=(x+n)^2$ for some
$x\in\Z$. A positive answer to B\"uchi's problem would imply that there is no
algorithm to decide whether or not an arbitrary system of quadratic diagonal
forms over $\Z$ can represent an arbitrary given vector of integers. We give
explicitly an infinite family of polynomial parametrizations of non-trivial
length $4$ B\"uchi sequences of integers.
B\"uchi's $n$ Squares Problem asks for an integer $M$ such that any sequence
$(x_0,...,x_{M-1})$, whose second difference of squares is the constant
sequence $(2)$ (i.e. $x^2_n-2x^2_{n-1}+x_{n-2}^2=2$ for all $n$), satisfies
$x_n^2=(x+n)^2$ for some integer $x$. Hensley's problem for $r$-th powers
(where $r$ is an integer $\geq2$) is a generalization of B\"{u}chi's problem
asking for an integer $M$ such that, given integers $\nu$ and $a$, the quantity
$(\nu+n)^r-a$ cannot be an $r$-th power for $M$ or more values of the integer
$n$, unless $a=0$.