Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126758
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A126758
%S A126758 0,0,1,1,4,11,39,139,603,2925,16709,112054,888615,8321364
%N A126758 Number of biconnected 4-cycle-free graphs on n nodes with clique number 
               3.
%C A126758 It is possible that the definition should say "connected" rather than 
               "biconnected". Should be rechecked! - Max Alekseyev and Brendan McKay, 
               Jun 17 2008
%H A126758 Keith M. Briggs, <a href="http://keithbriggs.info/cgt.html">Combinatorial 
               Graph Theory</a>
%Y A126758 Sequence in context: A050987 A137191 A106269 this_sequence A149258 A149259 
               A050911
%Y A126758 Adjacent sequences: A126755 A126756 A126757 this_sequence A126759 A126760 
               A126761
%K A126758 nonn
%O A126758 1,5
%A A126758 N. J. A. Sloane (njas(AT)research.att.com), Feb 18 2007

    
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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research