Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.
A369605
Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =3a(11) =2a(12) =3a(13) =1a(14) =1a(15) =1a(16) =1a(17) =1a(18) =3a(19) =5a(20) =11a(21) =19a(22) =36a(23) =37a(24) =41a(25) =24a(26) =18a(27) =6a(28) =4a(29) =1
External references
- oeis: A369605