242784
domain: N
Appears in sequences
- Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.at n=25A019274
- Number of (n+2)X8 binary matrices with every 3X3 block having exactly four 1's.at n=6A181260
- Number of (n+2)X9 binary matrices with every 3X3 block having exactly four 1's.at n=5A181261