cp's OEIS Frontend

This sequence arose from an attempt to reproduce A069124 by following the description in Thurber, 2002.

Define a matrix G for powers of 2, by G(1)=[1], and G(2^(k+1)) of size 2^(k+1) X 2^(k+1) by the block matrix [G(2^k), G(2^k)+2^k; G(2^k)+2^k, G(2^k)], where G(2^k)+2^k means add 2^k to each element of G(2^k) [see Thurber, p. 198 for more detail].

This sequence computes the number of pseudo-Latin stable matchings in the upper left n X n submatrix of G. Again, consult Thurber for definitions of what constitutes a stable matching in this situation.

Thurber's computation of these values are presented in A069124, but an attempt to reproduce that sequence gave the numbers of this sequence. The values here appear to be always increasing (unlike A069124). This is interesting because much of the Thurber paper is concerned with proving that the number of pseudo-Latin stable matchings is strictly increasing.

The first point of difference with A069124 occurs at n=7, but note that some later values do agree.

Subsequent verification by Dan Eilers in A069194 indicates that it is likely this sequence which is incorrect. - Sean A. Irvine, May 17 2025