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”).

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.
0
1, 3, 44, 416, 26815, 464031
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
EXAMPLE
For n = 2: 3 = Fibonacci(4) = 3 = Fibonacci(2) + Fibonacci(3) = 1 + 2.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Ilya Gutkovskiy, Jan 08 2023
STATUS
approved