Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123301
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123301 Triangle read by rows: T(n,k) = number of specially labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = 1, ..., n-1). +0
1
1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 34, 1, 0, 0, 1, 199, 199, 1, 0, 0, 1, 916, 7037, 916, 1, 0, 0, 1, 3889, 117071, 117071, 3889, 1, 0, 0, 1, 15982, 1535601, 6317926, 1535601, 15982, 1, 0, 0, 1, 64747, 18271947, 228842801, 228842801, 18271947 (list; table; graph; listen)
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 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research