login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027682 Number of independent subsets of Hamming graph H(n,4). 0
2, 5, 209, 127545137 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

MAPLE

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

CROSSREFS

Sequence in context: A013105 A208210 A216458 * A096695 A084297 A041873

Adjacent sequences:  A027679 A027680 A027681 * A027683 A027684 A027685

KEYWORD

nonn,hard,more

AUTHOR

R. H. Hardin

EXTENSIONS

a(0) corrected by Sean A. Irvine, Nov 23 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 December 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)