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”).
%I #19 Jan 28 2023 12:39:38
%S 1,3,44,416,26815,464031
%N a(n) is the smallest positive integer which can be represented as the sum of distinct positive Fibonacci n-step numbers (with a single type of 1) in exactly n ways, or -1 if no such integer exists.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>
%e For n = 2: 3 = Fibonacci(4) = 3 = Fibonacci(2) + Fibonacci(3) = 1 + 2.
%Y Cf. A000119, A013583, A117546, A287656, A288120.
%K nonn,more
%O 1,2
%A _Ilya Gutkovskiy_, Jan 08 2023