OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(3) = 6 is a term because the Fibonacci-Lucas representation 6 = 5 + 1 and the Lucas-Fibonacci representation 6 = 4 + 2 both have length 2.
MAPLE
Fibs:= [seq(combinat:-fibonacci(i), i=2..30)]:
Lucs:= [1, 3, seq(Fibs[n+1]+Fibs[n-1], n=2..28)]:
f:= proc(n, t) local x, i; uses ListTools;
x:= n;
for i from 1 do
if i::t then x:= x - Fibs[BinaryPlace(Fibs, x+1)]
else x:= x - Lucs[BinaryPlace(Lucs, x+1)]
fi;
if x = 0 then return i fi;
od
end proc:
select(k -> f(k, odd) = f(k, even), [$1..300]);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Jun 12 2026
STATUS
approved
