12861

Properties

Appears in sequences

• Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.at n=46A069831
• Numbers k such that k! + (k+1)! + 1 is prime.at n=8A087147
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 0, 1), (1, 0, 0), (1, 0, 1)}.at n=7A151087
• The number of pairs of permutations in the product group S_n X S_n with k common descents, n >= 1 and 0 <= k <= n-1.at n=34A192721
• Number of nX1 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.at n=11A199350
• Number of (n+2) X 4 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order.at n=5A204486
• Number of (n+2)X8 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order.at n=1A204490
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order.at n=22A204492
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order.at n=26A204492
• Triangle of numbers C^(7)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 7 appearances allowed.at n=53A213808
• Number of distinct values of the sum of 2 products of three 0..n integers.at n=20A225259
• Triangle of transformations with k monotonic runs.at n=34A225753
• Triangle read by rows, (Sum_{k=0..n} T[n,k]*x^k) / (1-x)^(n+1) are generating functions of the columns of A287316.at n=38A287315
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=26A288983
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=27A288983
• Number of set partitions of [n] with alternating parity of elements and exactly three blocks.at n=13A305777
• Number of separable partitions of n; see Comments.at n=36A325534
• Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 3n.at n=10A334056
• Triangle read by rows: T(n,k) is the number of set partitions of {1..3n} into n sets of 3 with k disjoint strings of adjacent sets, each being a contiguous set of elements.at n=10A334060
• Odd composite integers m such that A006497(3*m-J(m,13)) == 11*J(m,13) (mod m), where J(m,13) is the Jacobi symbol.at n=45A339725