29212

Appears in sequences

• Sum of Gaussian binomial coefficients [n,k] for q=2 and k=0..n.at n=7A006116
• Numbers k such that 141*2^k+1 is prime.at n=43A032420
• Expansion of (1-x)^(-1)/(1 - 2*x - x^2 + x^3).at n=12A077850
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,4,6,4,1.at n=21A221997
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=7A251944
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=37A251950
• Triangle read by rows: T(n,k) is the number of chains of length k in the partially ordered (by subspace inclusion) set of all subspaces of GF(2)^n, n>=0, 0<=k<=n.at n=28A293845
• Number of n X 4 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=4A297310
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=32A297314
• Number of 5Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=3A297318
• Number of distinct hook length sets of partitions of n.at n=48A301512
• Triangle read by rows: T(n,k) is the number of ways to choose a k-dimensional subspace U of an n-dimensional vector space over GF(2) and then choose a subspace of U.at n=28A302595
• Sum of numbers of ways to choose a k-chain of divisors of n - k, for k = 0..n - 1.at n=33A343940
• Square array read by descending antidiagonals: T(n,k) is the number of subgroups of the elementary abelian group of order A000040(k)^n for n >= 0 and k >= 1.at n=35A370887
• Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).at n=29A381058
• Rectangular array read by antidiagonals: T(n,k) is the number of labeled digraphs on [n] along with a (coloring) function c:[n] -> [k] with the property that for all u,v in [n], u->v implies u<v and c(u)<c(v), n>=0, k>=0.at n=47A382223