Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123549
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123549 Number of unlabeled connected bicolored graphs on 2n nodes which are invariant when the two color classes are interchanged. +0
1
1, 2, 7, 36, 265, 3039, 56532 (list; graph; listen)
OFFSET

1,2

REFERENCES

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.

CROSSREFS

Row sums of A123550.

Sequence in context: A143805 A112293 A090352 this_sequence A009704 A141308 A012712

Adjacent sequences: A123546 A123547 A123548 this_sequence A123550 A123551 A123552

KEYWORD

nonn

AUTHOR

njas, Nov 14 2006

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 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research