Skip to content

Summary of block A208

40 sequences
  • A208044: Number of n X 3 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any horizontal, vertical or antidiagonal neighbor (colorings ignoring permutations of colors).

  • A208079: Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 0 vertically.

  • A208086: Number of 4 X (n+1) 0..1 arrays with every 2 X 2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..1 introduced in row major order.

  • A208088: Number of 7 X (n+1) 0..1 arrays with every 2 X 2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..1 introduced in row major order.

  • A208114: Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.

  • A208124: a(1)=2, a(n) = (4n/3)*(2n-1)!! (see A001147) for n>1.

  • A208131: Partial products of A052901.

  • A208138: Number of n X 4 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.

  • A208139: Number of n X 5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.

  • A208148: Number of n state 1 dimensional radius-1 totalistic cellular automata.

  • A208176: a(n) = F(n+1)^2, if n>=0 is even (F=A000045) and a(n) = (L(2n+2)+8)/5, if n is odd (L=A000204).

  • A208309: Number of n X 3 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors.

  • A208355: Right edge of the triangle in A208101.

  • A208387: Number of nX3 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

  • A208402: Number of n X 2 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

  • A208428: Number of n X 2 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).

  • A208473: Central coefficients of triangle A185384.

  • A208493: Number of pairs of complementary l_1-graphs among all graphs on n nodes.

  • A208528: Number of permutations of n>1 having exactly 3 points P on the boundary of their bounding square.

  • A208529: Number of permutations of n > 1 having exactly 2 points on the boundary of their bounding square.

  • A208536: Number of 5-bead necklaces of n colors not allowing reversal, with no adjacent beads having the same color.

  • A208556: Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 1 vertically.

  • A208561: Number of n X 2 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or left-upward diagonal neighbors.

  • A208598: Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.

  • A208638: Number of 3 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

  • A208648: Denominators of Pokrovskiy’s lower bound on the ratio of e(G^n) the number of edges in the n-th power of a graph G, to E(G) the number of edges of G.

  • A208658: Row sums of A208657.

  • A208704: Number of nX3 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

  • A208705: Number of n X 4 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

  • A208900: Number of bitstrings of length n which (if having two or more runs) the last two runs have different lengths.

  • A208901: Number of bitstrings of length n (with at least two runs) where the last two runs have different lengths.

  • A208902: The sum over all bitstrings b of length n of the number of runs in b not immediately followed by a longer run.

  • A208903: The sum over all bitstrings b of length n with at least two runs of the number of runs in b not immediately followed by a longer run.

  • A208951: Twice the maximum of the areas of the convex hulls of permutations {(1,p(1)), (2,p(2)), …, (n,p(n))} of {1, 2, …, n}, considered as points in the plane.

  • A208952: Number of distinct values of the areas of the convex hulls of permutations {(1,p(1)), (2,p(2)), …, (n,p(n))} of {1, 2, …, n}, considered as points in the plane.

  • A208953: Amounts (in cents) of coins in denominations suggested by Shallit.

  • A208954: a(n) = n^4*(n-1)*(n+1)/12.

  • A208971: Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.

  • A208994: Number of 3-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first differences in -n..n.

  • A208995: Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first differences in -n..n.