Ladder

Off ladder — the ladder

2 distinct arguments against one idea, from the one that introduces it to the one that assumes the rest.
  1. The 10 sequences the settling table's destinations belong to. Every pair the counter returns is two consecutive terms of a sequence in which each term is the sum of the two before it, which is the ladder's own rule. two of these are the sequences this collection is built on. The rest are not, and they are not rare: the 1, 4, 5, 9, 14 sequence and the 2, 5, 7, 12, 19 sequence each supply several destinations, at every falloff exponent the table is grown at. The right-hand column is the divergences that land on each.

    Ten sequences, two of them the ladder's

    Every parastichy pair the settling table produces is two consecutive terms of a sequence in which each term is the sum of the two before it. Ten such sequences account for all fifteen destinations, and the two the collection is built on are neither the largest nor the smallest.

    rung 1 · emergence
  2. The destinations a steep rule reaches, read two ways. Above: the list read to a tenth of a degree, which is what the settling table prints — 13 entries. Below: the same list read at half a degree, which is two steps of the grid the azimuths are placed on — 3. The 10 entries the finer reading adds are destinations a shallow exponent also reaches, a tenth or two of a degree away, and a tenth of a degree is a fifth of one step of that grid. The pale marks are every destination in the table, for scale.

    A list that was a rounding

    Three destinations only a steep falloff reaches, read at two grid steps. Thirteen, read at a tenth of a degree. And four arrangements, read by what the counter returns rather than by the angle — a different four, with one the angle reading hides.

    rung 2 · emergence

All ladders