cp's OEIS Frontend

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.

A339160 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges and k nodes (n >= 1, 2 <= k <= n + 1).

This page as a plain text file.
%I A339160 #14 Feb 25 2023 18:09:05
%S A339160 1,1,0,1,1,0,1,1,1,0,1,2,2,1,0,1,3,6,3,1,0,1,4,11,11,4,1,0,1,5,22,33,
%T A339160 23,5,1,0,1,7,38,89,96,40,7,1,0,1,8,63,212,345,234,70,8,1,0,1,10,98,
%U A339160 463,1083,1146,546,110,10,1,0,1,12,151,943,3068,4739,3505,1169,176,12,1,0
%N A339160 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges and k nodes (n >= 1, 2 <= k <= n + 1).
%H A339160 Andrew Howroyd, <a href="/A339160/b339160.txt">Table of n, a(n) for n = 1..210</a> (rows 1..20)
%F A339160 T(n,2) = T(n,n) = 1.
%e A339160 Triangle T(n,k) begins (n edges >= 1, k vertices >= 2):
%e A339160   1;
%e A339160   1,  0;
%e A339160   1,  1,   0;
%e A339160   1,  1,   1,   0;
%e A339160   1,  2,   2,   1,    0;
%e A339160   1,  3,   6,   3,    1,    0;
%e A339160   1,  4,  11,  11,    4,    1,    0;
%e A339160   1,  5,  22,  33,   23,    5,    1,    0;
%e A339160   1,  7,  38,  89,   96,   40,    7,    1,   0;
%e A339160   1,  8,  63, 212,  345,  234,   70,    8,   1,  0;
%e A339160   1, 10,  98, 463, 1083, 1146,  546,  110,  10,  1, 0;
%e A339160   1, 12, 151, 943, 3068, 4739, 3505, 1169, 176, 12, 1, 0;
%e A339160   ...
%Y A339160 Column k=3 is A001399(n-3).
%Y A339160 Row sums are A010357.
%Y A339160 Cf. A046752, A191646, A339070.
%K A339160 nonn,tabl
%O A339160 1,12
%A A339160 _Andrew Howroyd_, Dec 05 2020