Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0<i<n, with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.
A067148
Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0<i<n, with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =2a(7) =2a(8) =2a(9) =1a(10) =3a(11) =1a(12) =3a(13) =2a(14) =2a(15) =1a(16) =3a(17) =2a(18) =2a(19) =2a(20) =3a(21) =1a(22) =4a(23) =1a(24) =2a(25) =2a(26) =2a(27) =2a(28) =4a(29) =1
External references
- oeis: A067148