Voozh

VOOZH

URL: https://oeis.org/A359391

⇱ A359391 - OEIS

login

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.

0

1, 2, 3, 16, 27, 71, 116, 278, 451, 818, 1305, 2169, 3925, 8119, 13117, 23252, 37858, 62999, 101939, 178088, 298357, 484576, 813710, 1613509, 2610739, 4224275, 6845969, 11280196, 19772533, 32524576, 53157802, 85936132

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..31.

EXAMPLE

For n = 3: 16 = Fibonacci(1) + Fibonacci(3) + Fibonacci(7) =

Fibonacci(2) + Fibonacci(3) + Fibonacci(7) =

Fibonacci(4) + Fibonacci(5) + Fibonacci(6) =

1 + 2 + 13 =

1'+ 2 + 13 =

3 + 5 + 8.

CROSSREFS

Cf. A000045, A000121, A013583, A083853.

Sequence in context: A074759 A175699 A102882 * A085734 A302837 A034382

Adjacent sequences: A359388 A359389 A359390 * A359392 A359393 A359394

KEYWORD

nonn,more

AUTHOR

Ilya Gutkovskiy, Dec 29 2022

EXTENSIONS

a(0), a(10)-a(18) from Alois P. Heinz, Dec 29 2022

a(19)-a(31) from David A. Corneth, Dec 30 2022

STATUS

approved