a(n) is the smallest integer that can appear as the n-th term of two distinct nondecreasing sequences of positive integers that satisfy the Fibonacci recurrence relation.

A286983

a(n) is the smallest integer that can appear as the n-th term of two distinct nondecreasing sequences of positive integers that satisfy the Fibonacci recurrence relation.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =9a(4) =20a(5) =48a(6) =117a(7) =294a(8) =748a(9) =1925a(10) =4984a(11) =12960a(12) =33785a(13) =88218a(14) =230580a(15) =603057a(16) =1577836a(17) =4129232a(18) =10807885a(19) =28291230a(20) =74060636a(21) =193882317a(22) =507572784a(23) =1328814144a(24) =3478834225a(25) =9107631218a(26) =23843966692a(27) =62424118809a(28) =163428146948a(29) =427859929200

External references