22904

Appears in sequences

• Increasing gaps in A038593 (upper terms).at n=14A093362
• Smaller side not divisible by 37 of right triangles with integer sides and integer side inscribed squares with two vertices on the hypotenuse.at n=26A123697
• Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.at n=51A157012
• Partial sums of A068148.at n=28A178137
• Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=23A250723
• Number of (n+2)X(2+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=5A251646
• Number of (n+2)X(6+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=1A251650
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=22A251652
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=26A251652
• Number of cells formed by connecting all the 4n points on the perimeter of an n X n square by straight lines; a(0) = 0 by convention.at n=8A255011
• Linear coefficient (in absolute value) of the quadratic polynomials giving the numbers of 2k-cycles in the n X n grid graph for n >= k-1.at n=7A302336
• Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=35A331452
• Number of ways to write n as an ordered sum of 7 nonprime numbers.at n=30A341484
• Triangle of coefficients T(n,k) of x^n*y^k in g.f. A(x,y) satisfying y = Sum_{n=-oo..+oo} (-1)^n * x^n * (y*A(x,y) + x^(n-1))^(n+1).at n=47A359670
• Column 2 of triangle A359670; a(n) = A359670(n+2,2) for n >= 0.at n=7A359715
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=37A367323