THE FOLD / SPAWN / FIRST LIGHT / THE BOUSTROPHEDON
THE BOUSTROPHEDON
an ox-plough triangle that grows the zigzag numbers
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The boustrophedon transform — ‘ox-turning,’ the way a plough sweeps back and forth — builds a triangle of numbers by reading each new row in the opposite direction from the last. Each entry is the running sum of the one before it plus the one across from the row above.
Fed the simplest seed (1, 0, 0, 0, …) it generates the zigzag / Euler numbers 1, 1, 1, 2, 5, 16, 61, 272, 1385, … — which count the alternating permutations (up-down zigzags) of n items, and are exactly the Taylor coefficients of tan + sec. One back-and-forth sum, and three different worlds meet.
LIT verified live: the transform of (1,0,0,…) reproduces the zigzag numbers A000111 exactly, and for small n they equal the counted number of alternating permutations (window.__boustrophedon). FIG no framing; exact integer recurrence.
Fed the simplest seed (1, 0, 0, 0, …) it generates the zigzag / Euler numbers 1, 1, 1, 2, 5, 16, 61, 272, 1385, … — which count the alternating permutations (up-down zigzags) of n items, and are exactly the Taylor coefficients of tan + sec. One back-and-forth sum, and three different worlds meet.
LIT verified live: the transform of (1,0,0,…) reproduces the zigzag numbers A000111 exactly, and for small n they equal the counted number of alternating permutations (window.__boustrophedon). FIG no framing; exact integer recurrence.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at first-light — a whole pattern grown, row by row, from a single seed. The boustrophedon triangle is first-light arithmetic: start with one 1, plough back and forth, and a deep sequence appears. AVAN (AI) built the instrument: the Seidel triangle, the zigzag check, the alternating-permutation count.
Credit as content: the Seidel–Entringer–Arnold triangle (Ludwig Seidel 1877; Roger Entringer 1966; Vladimir Arnold 1991 linked it to singularity theory); ‘boustrophedon transform’ named by Millar, Sloane & Young (1996). The weave: David names the seed and the sweep; I grow the triangle and show the same numbers counting zigzags and expanding tan+sec.
Credit as content: the Seidel–Entringer–Arnold triangle (Ludwig Seidel 1877; Roger Entringer 1966; Vladimir Arnold 1991 linked it to singularity theory); ‘boustrophedon transform’ named by Millar, Sloane & Young (1996). The weave: David names the seed and the sweep; I grow the triangle and show the same numbers counting zigzags and expanding tan+sec.
3 ONE DIMENSION
The triangle filling row by row, arrows flipping direction each line like a plough. The number that lands at the end of each row — the boundary — is the next zigzag number.
4 TWO DIMENSIONS · INTERACTIVE
Build the triangle and read the zigzag numbers off the boundary; verify they match A000111. A counter enumerates the alternating (up-down) permutations of n and confirms the same values.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the triangle as terraced steps, each row a plough-sweep longer than the last, the zigzag numbers climbing its edge.
AVAN’s addition (the inverse-companion): the transform is invertible — an inverse boustrophedon sum runs the triangle backward and recovers the original seed, so nothing is lost; it is a reversible re-encoding, not a one-way collapse. And the deeper inverse is that one triangle is a Rosetta stone pointing three ways: the same integers count alternating permutations (combinatorics), expand tan + sec (analysis), and measure Arnold’s singularities (geometry). The inverse of ‘a number sequence’ is ‘the three unrelated questions it answers at once.’ Magenta is the seed the inverse recovers; green is the zigzag output on the edge. A back-and-forth sum that quietly unifies counting, calculus, and geometry in one row of integers.
LIT Genuine boustrophedon transform / Seidel-Entringer-Arnold triangle (Seidel 1877; Entringer 1966; Arnold 1991; named by Millar, Sloane & Young 1996). Verified live: the transform of (1,0,0,...) via T[i][k]=T[i][k-1]+T[i-1][i-k] reproduces the zigzag numbers A000111 = 1,1,1,2,5,16,61,272,1385 exactly, and a direct count of alternating up-down permutations of 1..n matches these values (window.__boustrophedon.matchesZigzag).
FIG No framing: the triangle recurrence, the A000111 comparison, and the alternating-permutation enumeration run in-browser and are exact. The AVAN inverse is honest — the transform is genuinely invertible (recovers the seed), and the same integers genuinely count alternating permutations, expand tan+sec, and (per Arnold) measure singularities; magenta is the seed the inverse recovers.
FIG No framing: the triangle recurrence, the A000111 comparison, and the alternating-permutation enumeration run in-browser and are exact. The AVAN inverse is honest — the transform is genuinely invertible (recovers the seed), and the same integers genuinely count alternating permutations, expand tan+sec, and (per Arnold) measure singularities; magenta is the seed the inverse recovers.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of FIRST LIGHT · David Lee Wise (ROOT0), with AVAN