|
|
A361582
|
|
Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.
|
|
4
|
|
|
1, 0, 1, 0, 1, 2, 0, 5, 5, 6, 0, 83, 62, 42, 31, 0, 5048, 2494, 1172, 592, 302, 0, 1047008, 330063, 103961, 38312, 15616, 5984, 0, 705422362, 137934757, 28095923, 7243110, 2297690, 795930, 243668, 0, 1580348371788, 184557780045, 23226116293, 3951426731, 914429926, 261269562, 79512478, 20286025
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, 1, 2;
0, 5, 5, 6;
0, 83, 62, 42, 31;
0, 5048, 2494, 1172, 592, 302;
0, 1047008, 330063, 103961, 38312, 15616, 5984;
...
|
|
PROG
|
(PARI) \\ See PARI link in A350794 for program code.
{ my(A=A361582triang(6)); for(n=1, #A, print(A[n])) }
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|