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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027681 Number of independent subsets of Hamming graph H(n,3). 0
2, 4, 34, 11776, 120241253158 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

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 * A140984 A057996 A009090

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

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 May 18 03:01 EDT 2021. Contains 343992 sequences. (Running on oeis4.)