![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
Sloane's influential On-Line Encyclopedia of Integer Sequences is an indispensable research tool in the service of the mathematical community. The sequence A001611 listing the “Fibonacci numbers + 1” contains a very large number of references and links. The sequence A000071 for the “Fibonacci numbers −1” contains an even larger number. Strangely, resentment seems to prevail between the two sequences; they do not acknowledge each other's existence, though both stem from the Fibonacci numbers. Using an elegant result of Kimberling, we prove a theorem that links the two sequences amicably. We relate the theorem to a result about iterations of the floor function, which introduces a new game.