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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263230 Triangle read by rows: T(n,k) is the number of graphs with n vertices and k spanning forests. 1
1, 2, 3, 0, 1, 6, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 10, 0, 6, 2, 1, 0, 0, 3, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row sums give A000088, n >= 1.

LINKS

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

FindStat - Combinatorial Statistic Finder, The number of spanning forests of a graph.

EXAMPLE

Triangle begins:

1,

2,

3,0,1,

6,0,2,1,0,0,0,1,0,0,0,0,0,0,0,1,

...

CROSSREFS

Cf. A000088.

Sequence in context: A317613 A292628 A163465 * A319665 A004443 A171616

Adjacent sequences:  A263227 A263228 A263229 * A263231 A263232 A263233

KEYWORD

nonn,tabf

AUTHOR

Christian Stump, Oct 15 2015

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)