A386277 - cp's OEIS frontend

A386277 For n >= 0, a(n) is the least Fibonacci number F_i (A000045) such that for some k >= 0, F_i = (n + 1)(n + 2k)/2, or a(n) = -1 if no such k exists.

n	a(n)
0	0
1	1
2	3
3	34
4	55
5	21
6	21
7	-1
8	144
9	55
10	55
11	-1
12	377
13	987
14	6765
15	2584
16	2584
17	-1
18	2584
19	610
20	987
21	6765
22	46368
23	-1
24	75025
25	377
26	14930352
27	-1
28	317811
29	6765
30	832040
31	14930352
32	6765
33	-1
34	102334155
35	-1
36	4181
37	-1
38	317811
39	-1
40	6765
41	987
42	701408733
43	-1
44	1548008755920
45	-1
46	2178309
47	-1
48	225851433717

[0, 1, 3, 34, 55, 21, 21, -1, 144, 55, 55, -1, 377, 987, 6765, 2584, 2584, -1, 2584, 610, 987, 6765, 46368, -1, 75025, 377, 14930352, -1, 317811, 6765, 832040, 14930352, 6765, -1, 102334155, -1, 4181, -1, 317811, -1, 6765, 987, 701408733, -1, 1548008755920, -1, 2178309, -1, 225851433717]

cp's OEIS Frontend

A386277 For n >= 0, a(n) is the least Fibonacci number F_i (A000045) such that for some k >= 0, F_i = (n + 1)(n + 2k)/2, or a(n) = -1 if no such k exists.

Table of values

List of values

cp's OEIS Frontend

A386277 For n >= 0, a(n) is the least Fibonacci number F_i (A000045) such that for some k >= 0, F_i = (n + 1)*(n + 2*k)/2, or a(n) = -1 if no such k exists.

Table of values

List of values

A386277 For n >= 0, a(n) is the least Fibonacci number F_i (A000045) such that for some k >= 0, F_i = (n + 1)(n + 2k)/2, or a(n) = -1 if no such k exists.