Triangle read by rows: T(n,k) is the number of labeled graphs with vertex set [n] that are reachable in k (but no fewer) steps from a given graph on [n], where a step consists of choosing a subset S of [n] and replacing the subgraph induced by S with its complement, 0 <= k <= n-1.
A370609
Triangle read by rows: T(n,k) is the number of labeled graphs with vertex set [n] that are reachable in k (but no fewer) steps from a given graph on [n], where a step consists of choosing a subset S of [n] and replacing the subgraph induced by S with its complement, 0 <= k <= n-1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =3a(6) =1a(7) =11a(8) =40a(9) =12a(10) =1a(11) =26a(12) =280a(13) =657a(14) =60a(15) =1a(16) =57a(17) =1491a(18) =13447a(19) =17412a(20) =360a(21) =1a(22) =120a(23) =6930a(24) =178297a(25) =1127388a(26) =781896a(27) =2520
External references
- oeis: A370609