Triangular array read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k connected components, n>=0, 0<=k<=n.
A383656
Triangular array read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k connected components, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =2a(8) =3a(9) =1a(10) =0a(11) =8a(12) =11a(13) =6a(14) =1a(15) =0a(16) =52a(17) =60a(18) =35a(19) =10a(20) =1a(21) =0a(22) =502a(23) =472a(24) =255a(25) =85a(26) =15a(27) =1a(28) =0a(29) =6824
External references
- oeis: A383656