131776

Appears in sequences

• Expansion of g.f. 1/((1 - 4*x)*(1 - 6*x)).at n=6A016149
• 5th binomial transform of (0,1,0,1,...), A000035.at n=7A081199
• a(n) = (6^n + (-4)^n)/2.at n=7A083578
• Square array by antidiagonals of number of straight lines with n points in a k-dimensional hypercube with n points on each edge.at n=48A105373
• Square array T(n, k) = v(k, n)((1)), where v(n, q) = M*v(n-1, q), M = {{0, 1, 0}, {0, 0, 1}, {8*q^3, 6*q, 0}}, with v(0, q) = {1, 1, 1}, read by antidiagonals.at n=46A173747
• Number of collinear point 4-tuples in an n X n .. X n 7-dimensional cubical grid.at n=3A178287
• Number of n X 3 0..3 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=4A223063
• Number of nX5 0..3 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=2A223065
• T(n,k)=Number of nXk 0..3 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=23A223066
• T(n,k)=Number of nXk 0..3 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=25A223066
• Number of (n+2)X(n+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=2A254837
• 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=2A254840
• 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=12A254845
• a(n) is the number of row-convex domino towers with n bricks (rows need not be offset).at n=9A338531
• Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of regions in H_n.at n=31A370978