cp's OEIS Frontend

Number of permutations of length n with exactly one valley. Also (for n>0), the number of ways to pick two of the 2^(n-1) vertices of an n-1 cube that are not connected by an edge. - Aaron Meyerowitz, Apr 21 2014

a(n+1), n >= 1: Number of independent vertex pairs for Q_n, n >= 1: 2^(n-1) * (2^n - (n+1)) = T_(2^n - 1) - n * 2^(n-1) = L_n - E_n = A006516(n) - A001787(n), where L_n is the number of vertex pairs and E_n is the number of vertex pairs yielding edges. (Cf. A027624.) - Daniel Forgues, Feb 19 2015

From Petros Hadjicostas, Aug 08 2019: (Start)

Apparently, by saying "valley" of a permutation of [n], Aaron Meyerowitz indirectly assumes that a "valley" is an interior minimum of a permutation (i.e., we ignore possible minima at the endpoints). Since the complement of a permutation b_1 b_2 ... b_n (using one-line notation, not cycle notation) is (n+1-b_1) (n+1-b_2) ... (n+1-b_n), the current sequence is also the number of permutations of [n] with exactly one peak (that is, exactly one interior maximum).

Comtet (pp. 260-261 in his book) calls these peaks "intermediary peaks" to distinguish them from "left peaks" and "right peaks" (i.e., maxima at the endpoints).

(End)

In Minecraft worlds, a source block of water can be reacted with another source block, two blocks away. This reaction creates a third "infinite" source block in the unoccupied intermediate block, so called because if the intermediate water source is destroyed or picked up by a player using a bucket, it will immediately regenerate itself.

A placement of water at several positions in an n X n board is said to be *stable* if no infinite water physics can in fact occur (under otherwise optimal conditions). This means that the total quantity of water in the system is held constant.

In short, no two source blocks can be graph-distance 2 from each other. - Gus Wiseman, Nov 27 2019

Often incorrectly described as cellular automata, the observed behaviors of liquids within a board are inseparable in certain ways from states of affair outside of the board and events outside of the system. This aspect of Minecraft is poorly understood.

In Minecraft worlds, a source block of water can be reacted with another source block, two blocks away, linearly or diagonally. This reaction creates a third "infinite" source block in the unoccupied intermediate block or blocks, so called because if the intermediate water source is destroyed or picked up by a player using a bucket, it will immediately regenerate itself.

A placement of water at several positions in an n X n board is said to be static if no infinite water sources are created that are not already present. In particular, the total quantity of water in the system is held constant.

The independence number alpha(G) of a graph is the cardinality of the largest independent vertex set. The n-hypercube has alpha(G) = 1 for n = 0 and alpha(G) = 2^(n-1) for n >= 1. The independence polynomial for the n-hypercube is given by Sum_{k=0..alpha(G)} T(n,k)*t^k.

Since 0 <= k <= alpha(G), row n has length 2^(n-1) + 1 except for n = 0 which has length 2.

Jenssen, Perkins and Potukuchi proved asymptotics for independent sets of given size.

The independence number of the n-folded cube graphs is given by A058622(n-1).

The independence number alpha(G) of a graph is the cardinality of the largest independent vertex set. The n-hypercube has alpha(G) = 1 for n = 0 and alpha(G) = 2^(n-1) for n >= 1. The independence polynomial for the n-hypercube is given by Sum_{k=0..alpha(G)} A354802(n,k)*t^k, meaning that a(n) is the alternating sum of row n of A354802.

Jenssen, Perkins and Potukuchi proved asymptotics for independent sets of given size.

It appears that this sequence remains positive for n > 3.

a(n) is the number of orbits for the corresponding families of maximal independent vertex sets in the n-hypercube graph Q_n (see also A284707) under the action of the symmetry group S_n.