login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..28.

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: A104468 A293003 A110062 * A254539 A283827 A122087

Adjacent sequences:  A144212 A144213 A144214 * A144216 A144217 A144218

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Dec 20 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 07:18 EST 2018. Contains 299390 sequences. (Running on oeis4.)