|
| |
|
|
A144215
|
|
Triangle read by rows: T(n,k) = number of forests on n unlabeled nodes with all nodes of degree <= k (n>=1, 0 <= k <= n-1).
|
|
3
| |
|
|
1, 1, 2, 1, 2, 3, 1, 3, 5, 6, 1, 3, 7, 9, 10, 1, 4, 11, 17, 19, 20, 1, 4, 15, 28, 34, 36, 37
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| R. Neville, Graphs whose vertices are forests with bounded degree, Graph Theory Notes of New York, LIV (2008), 12-21.
|
|
|
EXAMPLE
| Triangle begins:
1
1 2
1 2 3
1 3 5 6
1 3 7 9 10
1 4 11 17 19 20
1 4 15 28 34 36 37
|
|
|
CROSSREFS
| The final diagonal gives A005195. Cf. A144529.
Sequence in context: A073300 A104468 A110062 * A122087 A139642 A143604
Adjacent sequences: A144212 A144213 A144214 * A144216 A144217 A144218
|
|
|
KEYWORD
| nonn,tabl,more
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Dec 20 2008
|
| |
|
|
