Fibonacci — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as recurrence — the same set of essays touches all of them, so they are one junction rather than several.
The family the Fibonacci numbers belong to
Fibonacci Nim lets a player take at most twice what the last one took, and the heaps the opener loses are the Fibonacci numbers. Two is an arbitrary number. At one the losing heaps are the powers of two, at three and four and five they are four more sequences, each with a linear recurrence whose lag is twice one less than the factor — until the factor is six, where the pattern stops.
What the numerals knew
Every factor in the Fibonacci Nim family gives a numeral system, and the rung below predicted its separation condition would be the lag of the recurrence the losing heaps satisfy. It is not. The gap is the factor — one at c = 1, Zeckendorf's two at c = 2, and c at every factor to eight — while the lag goes 1, 2, 4, 6, 8, 11, 14, 17 and leaves its own pattern at six. The numerals then solve every one of 194,480 states, cap and all.
Named alongside it
The objects these essays reach for when they reach for this one.
CounterexampleEnumerationFibonacci nimGolden ratioImpartialInvariantOutcome classPeriodicityRecurrenceStateZeckendorf representationSubtraction