login
A263338
Triangle read by rows: T(n,k) is the number of graphs with n vertices and Szeget index k.
0
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, 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, 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
OFFSET
1,18
COMMENTS
Row sums give A000088, n >= 1.
LINKS
FindStat - Combinatorial Statistic Finder, The Szeged index of a graph.
EXAMPLE
Triangle begins:
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,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,
...
CROSSREFS
Cf. A000088.
Sequence in context: A025448 A015010 A016011 * A103522 A101108 A279280
KEYWORD
nonn,tabf
AUTHOR
Christian Stump, Oct 15 2015
STATUS
approved