1346254domain: NAppears in sequencesa(0) = a(1) = 1; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2).at n=28A215004a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number.at n=29A215006a(n) = Fibonacci(2n + 1) - n.at n=14A280523