# Boustrophedon transform

In mathematics, the boustrophedon transform is a procedure which maps one sequence to another. The transformed sequence is computed by filling a triangular array in boustrophedon (zig-zag) manner.

## Definition

The boustrophedon transform: Start with the original sequence (in blue), then add numbers as indicated by the arrows, and finally read off the transformed sequence on the other side (in red, with ${\displaystyle b_{0}=a_{0}}$).

Given a sequence ${\displaystyle (a_{0},a_{1},a_{2},\ldots )}$, the boustrophedon transform yields another sequence, ${\displaystyle (b_{0},b_{1},b_{2},\ldots )}$, which is constructed by filling up a triangle as pictured on the right. Number the rows in the triangle starting from 0, and fill the rows consecutively. Let k denote the number of the row currently being filled.

If k is odd, then put the number ${\displaystyle a_{k}}$ on the right end of the row and fill the row from the right to the left, with every entry being the sum of the number to the right and the number to the upper right. If k is even, then put the number ${\displaystyle a_{k}}$ on the left end and fill the row from the left to the right, with every entry being the sum of the number to the left and the number to the upper left.

Defining ${\displaystyle b_{0}=a_{0}}$, the numbers ${\displaystyle b_{k}|k>0}$ forming the transformed sequence can then be found on the left end of odd-numbered rows and on the right end of even-numbered rows, that is, opposite to the numbers ${\displaystyle a_{k}}$.

## Recurrence relation

A more formal definition uses a recurrence relation. Define the numbers ${\displaystyle T_{k,n}}$ (with k ≥ n ≥ 0) by

${\displaystyle T_{k,0}=a_{k}\quad {\text{for }}k\geq 0,}$
${\displaystyle T_{k,n}=T_{k,n-1}+T_{k-1,k-n}\quad {\text{for }}k\geq n>0.}$

Then the transformed sequence is defined by ${\displaystyle b_{n}=T_{n,n}}$.

In the case a0 = 1, an = 0 (n > 0), the resulting triangle is called the Seidel–Entringer–Arnold Triangle and the numbers ${\displaystyle T_{k,n}}$ are called Entringer numbers (sequence A008281 in the OEIS). In this case the numbers in the transformed sequence bn are called the Euler up/down numbers. This is sequence A000111 on the On-Line Encyclopedia of Integer Sequences. These enumerate the number of alternating permutations on n letters and are related to the Euler numbers and the Bernoulli numbers.

## The exponential generating function

The exponential generating function of a sequence (an) is defined by

${\displaystyle EG(a_{n};x)=\sum _{n=0}^{\infty }a_{n}{\frac {x^{n}}{n!}}.}$

The exponential generating function of the boustrophedon transform (bn) is related to that of the original sequence (an) by

${\displaystyle EG(b_{n};x)=(\sec x+\tan x)\,EG(a_{n};x).}$

The exponential generating function of the unit sequence is 1, so that of the up/down numbers is sec x + tan x.

## References

• Jessica Millar, N.J.A. Sloane, Neal E. Young, "A New Operation on Sequences: the Boustrouphedon Transform," Journal of Combinatorial Theory, Series A, volume 76, number 1, pages 44–54, 1996. Also available in a slightly different version as e-print math.CO/0205218 on the arXiv.
• Weisstein, Eric W. (2002). CRC Concise Encyclopedia of Mathematics, Second Edition. Chapman & Hall/CRC. p. 273. ISBN 1-58488-347-2.