A386743 - cp's OEIS frontend

A386743 For n >= 0, a(n) is the least Fibonacci number F(i) such that F(i) = (2n + 1)(n + k) for some k >= 0.

n	a(n)
0	0
1	3
2	55
3	21
4	144
5	55
6	377
7	6765
8	2584
9	2584
10	987
11	46368
12	75025
13	14930352
14	317811
15	832040
16	6765
17	102334155
18	4181
19	317811
20	6765
21	701408733
22	1548008755920
23	2178309
24	225851433717
25	14930352
26	196418
27	6765
28	14930352
29	591286729879
30	832040
31	46368
32	9227465
33	72723460248141
34	46368

[0, 3, 55, 21, 144, 55, 377, 6765, 2584, 2584, 987, 46368, 75025, 14930352, 317811, 832040, 6765, 102334155, 4181, 317811, 6765, 701408733, 1548008755920, 2178309, 225851433717, 14930352, 196418, 6765, 14930352, 591286729879, 832040, 46368, 9227465, 72723460248141, 46368]

cp's OEIS Frontend

A386743 For n >= 0, a(n) is the least Fibonacci number F(i) such that F(i) = (2n + 1)(n + k) for some k >= 0.

Table of values

List of values

cp's OEIS Frontend

A386743 For n >= 0, a(n) is the least Fibonacci number F(i) such that F(i) = (2*n + 1)*(n + k) for some k >= 0.

Table of values

List of values

A386743 For n >= 0, a(n) is the least Fibonacci number F(i) such that F(i) = (2n + 1)(n + k) for some k >= 0.