a(n) = number of length-n sequences s with s[1]=1, s[2]=1, s[k-1] <=s[k] <= s[k-2]+s[k-1] (s is called a sub-Fibonacci sequence of length n).
A005269
a(n) = number of length-n sequences s with s[1]=1, s[2]=1, s[k-1] <=s[k] <= s[k-2]+s[k-1] (s is called a sub-Fibonacci sequence of length n).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =10a(4) =31a(5) =127a(6) =711a(7) =5621a(8) =64049a(9) =1067599a(10) =26287664a(11) =963023487a(12) =52766766100
External references
- oeis: A005269