57629
domain: N
Appears in sequences
- A Fibonacci-like model in which each pair of rabbits dies after the birth of their 4th litter: a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5).at n=27A072465
- Row sums of (A008550 formatted as a triangular array).at n=10A132745
- Number of partitions p of n containing floor((min(p) + max(p))/2) as a part.at n=48A238482
- Number of (n+2)X(n+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7.at n=5A252184
- Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7.at n=5A252190
- Squares where A323811 gets stuck.at n=11A323815