63363
domain: N
Appears in sequences
- Number of loopless multigraphs with 6 nodes and n edges.at n=14A014396
- a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4) for n > 3, with a(0) = 1, a(1) = 3, a(2) = 9, a(3) = 27.at n=11A084707
- Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.at n=50A126732
- Number of connected graphs on n nodes with edge chromatic number 5.at n=8A126735