A027681 Number of independent subsets of Hamming graph H(n,3).

2, 4, 34, 11776, 120241253158

Offset

0,1

Links

Table of n, a(n) for n=0..4.

R. M. Falcon, Enumeration and classification of self-orthogonal partial latin rectangles by using the polynomial method, Eur. J. Comb. 48 (2015) 215-223, Table 1.

Example

For n=0, the two sets are the empty set and a set containing a single isolated vertex. - Sean A. Irvine, Nov 22 2019

Crossrefs

Sequence in context: A006989 A236399 A132529 * A348094 A140984 A057996

Adjacent sequences: A027678 A027679 A027680 * A027682 A027683 A027684

Keyword

nonn,hard,more

Author

R. H. Hardin

Extensions

a(0) corrected by Sean A. Irvine, Nov 22 2019

Status

approved