A374924 - cp's OEIS frontend

A374924 Zero-avoiding Fibonacci sequence: a(n) is the largest zeroless number that can be written as a(i) + a(j) where 1 ≤ i < j < n with a(1) = a(2) = 1.

n	a(n)
1	1
2	1
3	2
4	3
5	5
6	8
7	13
8	21
9	34
10	55
11	89
12	144
13	233
14	377
15	521
16	898
17	1419
18	2317
19	3736
20	5155
21	8891
22	12627
23	21518
24	34145
25	55663
26	77181
27	132844
28	166989
29	299833
30	466822
31	766655
32	1233477
33	1366321
34	2599798
35	3966119
36	6565917
37	9165715
38	15731632
39	24897347
40	31463264
41	47194896
42	62926528
43	94389792
44	141584688
45	188779584

[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 521, 898, 1419, 2317, 3736, 5155, 8891, 12627, 21518, 34145, 55663, 77181, 132844, 166989, 299833, 466822, 766655, 1233477, 1366321, 2599798, 3966119, 6565917, 9165715, 15731632, 24897347, 31463264, 47194896, 62926528, 94389792, 141584688, 188779584]

cp's OEIS Frontend

A374924 Zero-avoiding Fibonacci sequence: a(n) is the largest zeroless number that can be written as a(i) + a(j) where 1 ≤ i < j < n with a(1) = a(2) = 1.

Table of values

List of values