login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027682 Number of independent subsets of Hamming graph H(n,4). 0

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)