Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027681
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A027681
%S A027681 1,4,34,11776,120241253158
%N A027681 Number of independent subsets of Hamming graph H(n,3).
%Y A027681 Sequence in context: A113231 A055621 A000860 this_sequence A097382 A003349 
               A068968
%Y A027681 Adjacent sequences: A027678 A027679 A027680 this_sequence A027682 A027683 
               A027684
%K A027681 nonn
%O A027681 0,2
%A A027681 R. H. Hardin (rhhardin(AT)att.net)

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research