login
Irregular triangle read by rows: T(n,k) is the number of connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.
2

%I #5 Feb 09 2024 08:43:47

%S 1,2,1,4,4,4,1,8,12,24,38,48,28,8,1,16,32,96,280,784,1952,4304,7280,

%T 8720,7136,4192,1804,560,120,16,1

%N Irregular triangle read by rows: T(n,k) is the number of connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.

%e Triangle begins:

%e 1;

%e 2, 1;

%e 4, 4, 4, 1;

%e 8, 12, 24, 38, 48, 28, 8, 1;

%e 16, 32, 96, 280, 784, 1952, 4304, 7280, 8720, 7136, 4192, 1804, 560, 120, 16, 1;

%e ...

%Y Cf. A290758 (row sums), A369605 (up to automorphisms of the hypercube), A369997 (up to isomorphism).

%K nonn,tabf,more

%O 0,2

%A _Pontus von Brömssen_, Feb 07 2024