23 problems
Let be the th Fibonacci number, let be the exponent used to determine the sign in the source, and let be the Fibonomial coefficient corresponding to…
Let be the initial number of copies of in the Ordered Zeckendorf game, and let the Long Game Strategy (LGS) be the priority-based strategy that performs switch moves, com…
Let be an -Fibonacci sequence, and suppose it falls under case (vi) of the finite-orders conjecture, namely the case where the range of is conjec…
Let -Fibonacci sequences be defined by , , and . Let be the numbe…
Let be even, and let be the -Fibonacci sequence. For a modulus , let denote its Pisano period, let denote the number of zeros in that p…
Let be a positive integer. The Pisano period modulo is one shortest period of the Fibonacci sequence modulo , and its number of zeros is the order of . OEIS conjectur…
Let denote the Fibonacci numbers, let denote the associated arithmetic-progression sequence, and let and be the parameters defined in the p…
Let be a piece, and let a twisted Fibonacci spiral be the vertex configuration defined by four selected moves of in the Fibonacci-spiral pattern, together w…
Let be the th Fibonacci number and let . For the inside-out polytope associated with queens, let denote its denominator. Queen denominato…
Let be the th Fibonacci number, let , and let be the counting quasipolynomial for queens. Kotěšovec's conjecture. The pe…
Let , , and define . For , let be the…
Soydan–Németh–Szalay conjecture. Apart from these trivial solutions, the only solutions are
Fibonomial Lucas-type divisibility conjecture. If , then
Let an -core partition be a partition that is simultaneously -core and -core, and let denote the th Fibonacci number. Amdeberhan's conjecture. The number of…
Canonical-form conjecture. For all ,
Melham's conjecture. For any positive integers , there is a polynomial of degree with integer coefficients such that
Bruckman–Anderson conjecture. If is a prime power with , then
Let denote the th Fibonacci number, let be the -adic valuation, and let be the least positive integer such that divides . For a sequence, i…
Let and denote the Fibonacci and Lucas sequences, respectively. A sequence term is positive when its value is positive, and a term is odd when it is not divisible by…
Let denote the Fibonacci sequence. A Fibonacci number is positive when its value is positive, and an odd Fibonacci number is one not divisible by . Sun's prime–Fibonacci-p…
Let denote the Fibonacci numbers, and let … be the th Catalan number. A Fibonacci number is positive when it is positive as an integer. Hou and Zeng's prime–Fibonacci–Cata…
Let , , and for be the Fibonacci sequence. A Fibonacci number is positive when its index is positive and its value is positive.…
Fibonacci recurrence-coefficient conjecture. If , then , and for ,