55756

Appears in sequences

• T(2n,n), T given by A026692.at n=8A026693
• T(n,[ n/2 ]), T given by A026692.at n=16A026698
• Number of ways to cut a 2 X n rectangle into rectangles with integer sides.at n=8A034999
• Array read by antidiagonals: number of ways of dividing an n X m rectangle into integer-sided rectangles.at n=37A116694
• Array read by antidiagonals: number of ways of dividing an n X m rectangle into integer-sided rectangles.at n=43A116694
• Number of ways to cut an 8 X n rectangle into rectangles with integer sides.at n=2A220301
• Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2.at n=22A255226
• Difference between the numbers of trees on n vertices with an even number and an odd number of leaves.at n=29A262395
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 197", based on the 5-celled von Neumann neighborhood.at n=7A270717
• Least k such that at least half of the last n digits of 2^k are 9.at n=13A280660
• Concatenation of sum n+(n+1) and product n*(n+1) in decimal.at n=27A337148
• a(n) = (n^2 - n + 2) * (5*n^2 - 5*n + 2) / 4.at n=14A380353
• Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k*n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=48A392228