
REFERENCES

D. Gusfield and R. W. Irving, The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989, p. 25.
R. W. Irving and P. Leather, The complexity of counting stable marriages, SIAM J. Computing 15 (1986), 655667. [The sequence is v_n =g(2^n), where g(n) appears on page p. 657.]
D. E. Knuth, Mariages Stables, Presses Univ. de Montreal, 1976 (gives 10 matchings illustrating a(2)).
J. C. Lagarias, J. H. Spencer and J. P. Vinson, Counting dyadic equipartitions of the unit square, Discrete Math. 257 (2002), 481499. (Sequence is mentioned on fourth page.)
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
E. G. Thurber, Concerning the maximum number of stable matchings ..., Discrete Math., 248 (2002), 195219 (see Eq. (1)).


MATHEMATICA

RecurrenceTable[{a[0]==1, a[1]==2, a[n]==3a[n1]^22a[n2]^4}, a, {n, 8}] (* Harvey P. Dale, Mar 19 2012 *)
