2306866

Appears in sequences

• a(n) = floor(Fibonacci(n)/4).at n=35A004697
• a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).at n=11A049652
• a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).at n=5A049663
• Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={1,3}.at n=32A079962
• a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2).at n=31A131132
• Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).at n=30A213044
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|.at n=35A293553
• a(n) appears in the congruences modulo 4 or 32 of Markoff numbers m(n) = A002559(n) for odd or even m(n).at n=54A309376