36552

Appears in sequences

• Number of achiral polyominoes with n cubical cells of the regular tiling with Schläfli symbol {4,3,4} (or polycubes).at n=10A007743
• Numbers k such that 2^k - 3 is prime.at n=43A050414
• Triangle T(n,k) (0 <= k <= n) read by rows: top entry is 1, all other rows begin with 0; typical entry is sum of entry to left plus sum of all entries above it in the triangle.at n=41A059226
• Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=45A108914
• Number of n X 2 0..3 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=4A223069
• T(n,k)=Number of nXk 0..3 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=16A223071
• T(n,k)=Number of nXk 0..3 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=19A223071
• T(n,k) is the number of n X k 0..3 arrays with row sums nondecreasing and column sums unimodal.at n=19A224123
• Number of (n+1) X (4+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=0A250540
• T(n,k) = number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=6A250544
• T(n,k) = number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=9A250544
• Number of (n+1)X(4+1) 0..3 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=0A251797
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=6A251801
• a(n) = 35*2^n + 10*4^n + 20*3^n + 4*5^n + 6^n + 56.at n=5A254465
• Fourth partial sums of fifth powers (A000584).at n=5A254644
• Square array A(n,k), n >= 0, k >= 1, read by antidiagonals upwards, where A(n,k) = sum of unimodal products of length n and bound k.at n=39A287532