3985674
domain: N
Appears in sequences
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Fibonacci numbers).at n=31A024367
- Sum_{ k=1 ... floor(n/2) } A023532(k)*Fib(n-k).at n=31A024371
- Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.at n=31A079053
- Column 1 of triangle A118032, where column 1 of the matrix square of A118032 forms a bisection of this sequence.at n=31A118034
- Column 1 of triangle A118045; also equals a bisection of A118034, which is column 1 of A118032.at n=15A118047