# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a263000
Showing 1-1 of 1

%I A263000 #17 Oct 15 2015 15:29:20
%S A263000 1,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,2,1,1,1,1,1,1,2,1,1,1,2,1,2,1,2,4,4,
%T A263000 3,3,1,1,0,1,1,1,1,2,2,1,2,3,4,3,3,2,2,4,4,4,4,3,6,9,13,17,14,11,9,10,
%U A263000 4,6,4,3,0,2,1,0,0,1
%N A263000 Triangle T(n,k) read by rows: T(n,k) is the number of graphs of length n with Wiener index k.
%C A263000 Row sums give A000088, n >= 1. - _Omar E. Pol_, Oct 07 2015
%H A263000 FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000265">The Wiener index of a graph.</a>
%H A263000 Martin Knor, Riste Škrekovski, Aleksandra Tepeh, <a href="http://www.arXiv.org/abs/1510.00800">Mathematical aspects of Wiener index</a>, arXiv:1510.00800 [math.CO], (3-October-2015)
%e A263000 Triangle begins:
%e A263000 1,
%e A263000 1,1,
%e A263000 1,1,0,1,1,
%e A263000 1,1,1,1,1,0,1,1,2,1,1,
%e A263000 1,1,1,1,2,1,1,1,2,1,2,1,2,4,4,3,3,1,1,0,1,
%e A263000 1,1,1,2,2,1,2,3,4,3,3,2,2,4,4,4,4,3,6,9,13,17,14,11,9,10,4,6,4,3,0,2,1,0,0,1,
%e A263000 ...
%Y A263000 Cf. A000088.
%K A263000 nonn,tabf
%O A263000 1,17
%A A263000 _Christian Stump_, Oct 07 2015

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE