33468
domain: N
Appears in sequences
- Number of paw-free Berge perfect graphs on n nodes.at n=10A123445
- Number of (n+2) X 6 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=5A202457
- Number of (n+2) X 8 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=3A202459
- T(n,k)=Number of (n+2)X(k+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=39A202461
- Number of n-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero with no three beads in a row equal.at n=5A208937
- Number of n-bead necklaces labeled with numbers -6..6 not allowing reversal, with sum zero with no three beads in a row equal.at n=5A208943
- T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero with no three beads in a row equal.at n=60A208945
- Number of 6-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero with no three beads in a row equal.at n=5A208948
- Number of compositions of n into parts {3,4,5} when all parts 3,4 and 5 are present.at n=30A243254
- Numbers x such that there exist three integers 0<x<=y<=z and t>0 such that sigma(x)^2 = sigma(y)^2 = sigma(z)^2 = x^2 + y^2 + z^2 + t^2.at n=26A385531