This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A332402 #9 Feb 16 2025 08:33:59 %S A332402 1,1,1,2,1,1,4,5,1,1,11,16,5,1,1,34,90,25,5,1,1,156,668,188,25,5,1,1, %T A332402 1044,8648,2394,228,25,5,1,1,12346,199990,58578,3493,229,25,5,1,1, %U A332402 274668,8776166,2837118,113197,3758,229,25,5,1,1 %N A332402 Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with independent domination number k. %C A332402 The independent domination number of a graph is the minimum size of a maximal independent set (sets which are both independent and dominating). For any graph it is greater than or equal to the domination number (A263284) and less than or equal to the independence number (A263341). %C A332402 The final terms of each row tend to the sequence (1, 1, 5, 25, 229, 3759, ...). This happens because a connected graph on n nodes with n > 1 cannot have an independent domination number > floor(n/2). Similar limits are seen in A263284 and A332404 for the same reason. %H A332402 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a> %F A332402 T(n,k) = T(n-1,k-1) for 2*(k-1) >= n. %e A332402 Triangle begins: %e A332402 1; %e A332402 1, 1; %e A332402 2, 1, 1; %e A332402 4, 5, 1, 1; %e A332402 11, 16, 5, 1, 1; %e A332402 34, 90, 25, 5, 1, 1; %e A332402 156, 668, 188, 25, 5, 1, 1; %e A332402 1044, 8648, 2394, 228, 25, 5, 1, 1; %e A332402 12346, 199990, 58578, 3493, 229, 25, 5, 1, 1; %e A332402 274668, 8776166, 2837118, 113197, 3758, 229, 25, 5, 1, 1; %e A332402 ... %Y A332402 Row sums are A000088. %Y A332402 Column k=1 is A000088(n-1). %Y A332402 Cf. A263284, A263341, A332402, A332403, A332404, A332405. %K A332402 nonn,tabl %O A332402 1,4 %A A332402 _Andrew Howroyd_, Feb 11 2020