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.

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.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =5a(5) =8a(6) =13a(7) =21a(8) =34a(9) =55a(10) =89a(11) =144a(12) =233a(13) =377a(14) =521a(15) =898a(16) =1419a(17) =2317a(18) =3736a(19) =5155a(20) =8891a(21) =12627a(22) =21518a(23) =34145a(24) =55663a(25) =77181a(26) =132844a(27) =166989a(28) =299833a(29) =466822

External references