|
%I #13 Oct 16 2015 03:35:46
%S 1,1,1,1,1,0,1,1,1,1,1,1,1,0,1,0,1,2,1,0,0,0,0,0,1,1,1,1,1,2,1,1,0,1,
%T 2,2,0,0,1,1,2,5,1,2,2,2,0,0,0,2,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1,2,2,1,
%U 2,2,2,3,4,1,0,1,1,3,5,2,2,3,2,1,2,2,6,6,2,5,7,10,5,5,2,6,6,3,2,2
%N Triangle read by rows: T(n,k) is the number of graphs with n vertices and Szeget index k.
%C Row sums give A000088, n >= 1.
%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000263">The Szeged index of a graph</a>.
%e Triangle begins:
%e 1,
%e 1,1,
%e 1,1,0,1,1,
%e 1,1,1,1,1,0,1,0,1,2,1,0,0,0,0,0,1,
%e 1,1,1,1,2,1,1,0,1,2,2,0,0,1,1,2,5,1,2,2,2,0,0,0,2,0,0,0,1,1,0,0,0,0,0,0,1,
%e ...
%Y Cf. A000088.
%K nonn,tabf
%O 1,18
%A _Christian Stump_, Oct 15 2015
|
