The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #12 Jun 29 2021 11:54:45
%S 2,4,34,11776,120241253158
%N Number of independent subsets of Hamming graph H(n,3).
%H R. M. Falcon, <a href="https://doi.org/10.1016/j.ejc.2015.02.022">Enumeration and classification of self-orthogonal partial latin rectangles by using the polynomial method</a>, Eur. J. Comb. 48 (2015) 215-223, Table 1.
%e For n=0, the two sets are the empty set and a set containing a single isolated vertex. - _Sean A. Irvine_, Nov 22 2019
%K nonn,hard,more
%O 0,1
%A _R. H. Hardin_
%E a(0) corrected by _Sean A. Irvine_, Nov 22 2019