37642

Appears in sequences

• At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=43A064412
• Number of (n+1)X4 0..1 arrays with the sums of 2X2 subblocks nondecreasing rightwards and downwards.at n=4A204034
• Number of (n+1)X6 0..1 arrays with the sums of 2X2 subblocks nondecreasing rightwards and downwards.at n=2A204036
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sums of 2X2 subblocks nondecreasing rightwards and downwards.at n=23A204039
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sums of 2X2 subblocks nondecreasing rightwards and downwards.at n=25A204039
• Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally and vertically.at n=2A254839
• Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally and vertically.at n=1A254840
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally and vertically.at n=7A254845
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally and vertically.at n=8A254845
• Number of integer partitions of n with a permutation that has no consecutive monotone triple, i.e., no triple (..., x, y, z, ...) such that either x <= y <= z or x >= y >= z.at n=42A344740