A terrace for
![]()
is an arrangement
(a1,a2,…,am) of the
m elements of
![]()
such that the sets of differences
b10f86f0a2f995eb886017647f"" title=""Click to view the MathML source"" alt=""Click to view the MathML source"">ai+1-ai and
ai-ai+1 (i=1,2,…,m-1) between them contain each element of
![]()
exactly twice. For
m odd, many procedures are available for constructing power-sequence terraces for
![]()
; each terrace of this sort may be partitioned into segments one of which contains merely the zero element of
![]()
, whereas each other segment is either (a) a sequence of successive powers of an element of
![]()
or (b) such a sequence multiplied throughout by a constant. We now extend this idea by using power-sequences in
![]()
, where
n is an odd prime, to obtain terraces for
![]()
where
m=n+2. Our technique needs each of the
n-1 elements from
![]()
to be written so as to lie in the interval
(0,n) and for three further elements 0,
n and
n+1 then to be introduced. A segment of one of the new terraces may contain just a single element from the set
![]()
or it may be of type (a) or (b) with
m=n and containing successive powers of 2, each evaluated modulo
n. Also, a segment based on successive powers of 2 may be broken in one, two or three places by putting a different element from
![]()
in each break. We provide
![]()
terraces for all odd primes
n satisfying
0<n<1000 except for
32b1475607"" title=""Click to view the MathML source"" alt=""Click to view the MathML source"">n=127,601,683.