Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%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