cp's OEIS Frontend

A359391 a(n) is the smallest number which can be represented as the sum of n distinct positive Fibonacci numbers (1 is allowed twice as a part) in exactly n ways, or -1 if no such number exists.

%I A359391 #25 Jan 07 2023 11:05:50
%S A359391 1,2,3,16,27,71,116,278,451,818,1305,2169,3925,8119,13117,23252,37858,
%T A359391 62999,101939,178088,298357,484576,813710,1613509,2610739,4224275,
%U A359391 6845969,11280196,19772533,32524576,53157802,85936132
%N A359391 a(n) is the smallest number which can be represented as the sum of n distinct positive Fibonacci numbers (1 is allowed twice as a part) in exactly n ways, or -1 if no such number exists.
%e A359391 For n = 3: 16 = Fibonacci(1) + Fibonacci(3) + Fibonacci(7) =
%e A359391                 Fibonacci(2) + Fibonacci(3) + Fibonacci(7) =
%e A359391                 Fibonacci(4) + Fibonacci(5) + Fibonacci(6) =
%e A359391                 1 + 2 + 13 =
%e A359391                 1'+ 2 + 13 =
%e A359391                 3 + 5 + 8.
%Y A359391 Cf. A000045, A000121, A013583, A083853.
%K A359391 nonn,more
%O A359391 0,2
%A A359391 _Ilya Gutkovskiy_, Dec 29 2022
%E A359391 a(0), a(10)-a(18) from _Alois P. Heinz_, Dec 29 2022
%E A359391 a(19)-a(31) from _David A. Corneth_, Dec 30 2022