145669

Appears in sequences

• Number of (n+1)X(2+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=2A235217
• Number of (n+1)X(3+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=1A235218
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=7A235223
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=8A235223
• a(n) is the greatest integer k such that k/Fibonacci(n) < Pi.at n=24A293677
• a(n) is the integer k that minimizes |k/Fibonacci(n) - Pi|.at n=24A293679