cp's OEIS Frontend

A332760 Triangle of number of connected graphs with n>=2 nodes and maximum degree 1<=k

%I A332760 #17 Nov 06 2023 18:09:23
%S A332760 1,0,2,0,2,4,0,2,8,11,0,2,27,49,34,0,2,62,289,344,156,0,2,192,1735,
%T A332760 4457,3687,1044,0,2,529,11676,63493,109623,63411,12346,0,2,1731,87669,
%U A332760 1067440,3835541,4540334,1909186,274668,0,2
%N A332760 Triangle of number of connected graphs with n>=2 nodes and maximum degree 1<=k<n.
%H A332760 Mathoverflow, <a href="https://mathoverflow.net/questions/353308/what-is-the-number-of-connected-graphs-with-n-vertices-of-max-degree-up-to-d#353308">What is the number of connected graphs with n vertices of max. degree up to D?</a>
%F A332760 T(n,n-1) = A000088(n-1).
%F A332760 T(n,2) = 2 for n>2 as the only possibilities are a cycle graph or a path graph.
%e A332760 Triangle starts
%e A332760 1;
%e A332760 0,  2;
%e A332760 0,  2,  4;
%e A332760 0,  2,  8,    11;
%e A332760 0,  2,  27,   49,   34;
%e A332760 0,  2,  62,  289,  344,  156;
%e A332760 0,  2, 192, 1735, 4457, 3687, 1044;
%e A332760 0,  2,...
%Y A332760 Cf. A263293, A001349 (row sums), A000088.
%K A332760 nonn,tabl,more
%O A332760 2,3
%A A332760 _Henry Bottomley_, Feb 22 2020
%E A332760 a(32)-a(48) from _Chai Wah Wu_, Sep 08 2020