18332

Appears in sequences

• Number of factorizations of permutations of n letters into cycles in nondecreasing length order.at n=7A007841
• Number of 1X4 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 1 zero-sum 4-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=43A192691
• Number of (n+1) X 2 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=3A203780
• Number of (n+1)X5 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=0A203783
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=6A203787
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=9A203787
• Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two or three distinct values for every i<=n and j<=n.at n=11A211477
• Triangle read by rows: T(n,k) is the number of ascent sequences of length n with last occurrence of the maximal value at position k-1.at n=51A218581
• E.g.f.: A(x,y) = exp(y)*P(x) - Q(x,y), where P(x) = 1/Product_{n>=1} (1 - x^n/n) and Q(x,y) = Sum_{n>=1} y^n / Product_{k=1..n} (k - x^k).at n=28A249480
• Number of nX3 arrays containing 3 copies of 0..n-1 avoiding the pattern down-up in every row and column.at n=3A269504
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and column.at n=18A269505
• Number of 4Xn arrays containing n copies of 0..4-1 avoiding the pattern down-up in every row and column.at n=2A269508
• a(n) = n^3 + (n+1)*(n+2).at n=26A270109
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 675", based on the 5-celled von Neumann neighborhood.at n=23A273408
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=17A293767
• Numbers k such that (16*10^k + 41)/3 is prime.at n=19A294375
• Second Moebius transform of A000219. Number of plane partitions of n whose multiset of rows is aperiodic and whose multiset of columns is also aperiodic.at n=17A323584
• The number of irreducible balanced subsets of [n].at n=34A389802
• a(n) = A389802(2n+1).at n=17A389803
• Upper (1/3,1/2) midsequence of (n^2) and (n^3); see Comments.at n=33A390566