Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A126749
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A126749
Triangle read by rows: T(n,k) (n>=2, k=0..n-1) gives number of biconnected graphs on n nodes with chromatic number n-k.
+0
6
0, 1, 0, 1, 1, 1, 1, 2, 6, 1, 1, 3, 17, 30, 5, 1, 4, 34, 189, 232, 8, 1, 5, 59, 627, 3627, 2762, 42, 1, 6, 92, 1631, 23262, 118114, 50814, 146, 1, 7, 135, 3643, 101409, 1686975, 6530233, 1420183, 956
(
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 7 08:40 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
