|
Search: id:A059441
|
|
|
| A059441 |
|
Triangle T(n,k) (n >= 1, 0<=k<=n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows. |
|
+0
4
|
|
| 1, 1, 1, 1, 0, 1, 1, 3, 3, 1, 1, 0, 12, 0, 1, 1, 15, 70, 70, 15, 1, 1, 0, 465, 0, 465, 0, 1, 1, 105, 3507, 19355, 19355, 3507, 105, 1
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
