A359391 - cp's OEIS frontend

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.

n	a(n)
0	1
1	2
2	3
3	16
4	27
5	71
6	116
7	278
8	451
9	818
10	1305
11	2169
12	3925
13	8119
14	13117
15	23252
16	37858
17	62999
18	101939
19	178088
20	298357
21	484576
22	813710
23	1613509
24	2610739
25	4224275
26	6845969
27	11280196
28	19772533
29	32524576
30	53157802
31	85936132

[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]

cp's OEIS Frontend

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.

Table of values

List of values