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.
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.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =16a(4) =27a(5) =71a(6) =116a(7) =278a(8) =451a(9) =818a(10) =1305a(11) =2169a(12) =3925a(13) =8119a(14) =13117a(15) =23252a(16) =37858a(17) =62999a(18) =101939a(19) =178088a(20) =298357a(21) =484576a(22) =813710a(23) =1613509a(24) =2610739a(25) =4224275a(26) =6845969a(27) =11280196a(28) =19772533a(29) =32524576
External references
- oeis: A359391