A359631 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.

1, 3, 44, 416, 26815, 464031

Offset: 1

Author

Ilya Gutkovskiy, Jan 08 2023

Keywords

• nonn
• more

Examples

			For n = 2: 3 = Fibonacci(4) = 3 = Fibonacci(2) + Fibonacci(3) = 1 + 2.
		

Links

• Eric Weisstein's World of Mathematics, Fibonacci n-Step Number

Crossrefs

Cf. A000119, A013583, A117546, A287656, A288120.