# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a263230 Showing 1-1 of 1 %I A263230 #21 Oct 16 2015 14:01:51 %S A263230 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, %T A263230 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, %U A263230 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 %N A263230 Triangle read by rows: T(n,k) is the number of graphs with n vertices and k spanning forests. %C A263230 Row sums give A000088, n >= 1. %H A263230 FindStat - Combinatorial Statistic Finder, The number of spanning forests of a graph. %e A263230 Triangle begins: %e A263230 1, %e A263230 2, %e A263230 3,0,1, %e A263230 6,0,2,1,0,0,0,1,0,0,0,0,0,0,0,1, %e A263230 ... %Y A263230 Cf. A000088. %K A263230 nonn,tabf %O A263230 1,2 %A A263230 _Christian Stump_, Oct 15 2015 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE