|
%I #13 Jun 04 2022 21:51:27
%S 2,5,209,127545137
%N Number of independent subsets of Hamming graph H(n,4).
%C For n=0, the two sets are the empty set and a set containing a single isolated vertex. - _Sean A. Irvine_, Nov 23 2019
%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.
%K nonn,hard,more
%O 0,1
%A _R. H. Hardin_
%E a(0) corrected by _Sean A. Irvine_, Nov 23 2019
|
