|
%I #6 Feb 09 2024 08:43:59
%S 1,1,1,1,1,1,1,2,1,1,1,1,2,3,6,3,3,1,1,1,1,2,3,7,12,26,42,63,54,49,27,
%T 19,6,4,1,1
%N Irregular triangle read by rows: T(n,k) is the number of induced k-vertex subgraphs, up to isomorphism, of the hypercube graph of dimension n >= 0, 0 <= k <= 2^n.
%e Triangle begins:
%e 1, 1;
%e 1, 1, 1;
%e 1, 1, 2, 1, 1;
%e 1, 1, 2, 3, 6, 3, 3, 1, 1;
%e 1, 1, 2, 3, 7, 12, 26, 42, 63, 54, 49, 27, 19, 6, 4, 1, 1;
%e ...
%Y Cf. A039754 (up to automorphisms of the hypercube), A369996 (row sums), A369997 (connected subgraphs).
%K nonn,tabf,more
%O 0,8
%A _Pontus von Brömssen_, Feb 07 2024
|
