336567

Appears in sequences

• a(n) = floor(Fibonacci(n)/4).at n=31A004697
• a(n) = (Fibonacci(6*n+1) - 1)/4.at n=5A049661
• 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=28A079962
• a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 0, a(1) = 1, a(2) = 3.at n=10A110526
• 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=27A131132
• a(n) = sigma_2(n)*Fibonacci(n), where sigma_2(n) = A001157(n), the sum of squares of divisors of n.at n=15A203849
• Number of (n+1) X (4+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=16A259218
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|.at n=31A293553
• 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=42A309376