Thanks to everyone who made a donation during our annual appeal! To see the list of donors, or make a donation, see the OEIS Foundation home page.
%I
%S 2,5,209,127545137
%N Number of independent subsets of Hamming graph H(n,4).
%p For n=0, the two sets are the empty set and a set containing a single isolated vertex. - _Sean A. Irvine_, Nov 23 2019
%K nonn,hard,more
%O 0,1
%A _R. H. Hardin_
%E a(0) corrected by _Sean A. Irvine_, Nov 23 2019