login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A254123
Least number of terms needed to build n from Fibonacci numbers using + and *.
2
1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 1, 2, 2, 2, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 1, 2, 2, 2, 3, 2, 3, 3, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 1, 2, 2, 2
OFFSET
1,4
COMMENTS
a(n) = 1 iff n is a Fibonacci number (A000045).
a(n) = 2 iff n is in A254122.
a(A025282(n)) = n.
LINKS
EXAMPLE
a(40) = 2 because 40 = 5*8; 5 and 8 are Fibonacci numbers but 40 is not.
MAPLE
N:= 1000: # to get a(1) to a(N)
A:= Vector(N):
for i from 1 do
f:= combinat:-fibonacci(i);
if f > N then break fi;
A[f]:= 1
od:
for n from 1 to N do
if A[n] = 0 then
m:= floor(n/2);
r:= min(A[1..m] + A[[seq(n-i, i=1..m)]]);
for a in select(`<=`, numtheory:-divisors(n) minus {1}, floor(sqrt(n))) do
r:= min(r, A[a] + A[n/a])
od:
A[n]:= r;
fi
od:
seq(A[i], i=1..N);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Jan 25 2015
STATUS
approved