31512

Appears in sequences

• Transposition classes of ordered Latin bi-trades of size n.at n=14A133175
• a(n) = 1728*n - 1320.at n=18A157263
• Number of binary strings of length n with no substrings equal to 0000 0010 or 1010.at n=15A164422
• a(n) = 24*n*p(n) = 24*n*A000041(n).at n=12A183009
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=14A219715
• Number of (n+1) X (1+1) 0..1 arrays colored with the sum of the upper and lower median values of each 2 X 2 subblock.at n=11A236323
• Number of length 1+4 0..n arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=10A248988
• Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=4A262845
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=25A262849
• Number of (5+2)X(n+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=2A262854
• G.f. is the cube of the g.f. of A006950.at n=19A273226
• Positions of records in A174414.at n=11A376219
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y))^2 ).at n=38A382824
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y))^2 ).at n=42A382824
• Number of weak compositions of n such that the set of adjacent differences is a subset of {-1,1}.at n=23A383620