23376
domain: N
Appears in sequences
- Number of paths in the plane x >= 0 and y >= -2, from (0,0) to (n,0), and consisting of steps U = (1,1), D = (1,-1) and H = (1,0).at n=11A026325
- Structured small rhombicubeoctahedral numbers.at n=15A100149
- A PolyLog functional polynomial coefficient triangular sequence: p(x,n)=(-1)^(n + 1)*(4*x + x^2)^(n + 1)*PolyLog[ -n, 1 + 4*x + x^2]/(1 + 4*x + x^2).at n=30A142146
- Partial sums of sequence A177342.at n=15A178073
- Number of nX3 0..2 arrays with no more than floor(nX3/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=4A223145
- Number of nX5 0..2 arrays with no more than floor(nX5/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=2A223147
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=23A223149
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=25A223149
- Number of non-equivalent ways to choose two points in an equilateral triangle grid of side n.at n=31A227327
- Number of multisets of nonempty words with a total of n letters over octonary alphabet containing the eighth letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=5A293803
- Expansion of 1/(1 + 1/(1 - x) - Product_{k>=1} 1/(1 - x^k)).at n=15A317535