cp's OEIS Frontend

Since A(n,3) = A(n+1,4), A(n,3) gives essentially the same sequence.

The next term a(17) is in the range 2816-3276.

Let T_n be the set of SDS-maps of sequential dynamical systems defined over the complete graph K_n in which all vertices have the same vertex function (defined using a set of two possible vertex states). Then a(n) is the maximum number of period-2 orbits that a function in T_n can have. - Colin Defant, Sep 15 2015

Since the n-halved cube graph is isomorphic to (or, if you prefer, defined as) the graph with binary sequences of length n-1 as nodes and edges between pairs of sequences that differ in at most two positions, the independence number of the n-halved cube graph is A(n-1,3) = a(n). - Pontus von Brömssen, Dec 12 2018

a(2^k) = A(2^k-1, 3) = 2^(2^k-k-1) because the hypercube Q(2^k-1) can be perfectly packed with radius-1 spheres, corresponding to a Hamming(2^k-1, 2^k-k-1) code. - Yifan Xie, May 06 2025

According to Brouwer's web site, 46 <= a(18) <= 49, and a(19..24) = (78, 130, 210, 330, 506, 759). This matches A030069. - M. F. Hasler, May 25 2017

Packing number D(n,5,2). Maximum number of edge-disjoint K_5's in a K_n. - Rob Pratt, Feb 26 2024

Since A(n,5) = A(n+1,6), A(n,5) gives essentially the same sequence.

The next term is known only to be in the range 258-340. - Moshe Milshtein, Apr 24 2019