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.

A317671 Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).

Original entry on oeis.org

1, 1, 3, 10, 12, 16, 238, 215, 150, 125, 11368, 7740, 4140, 2160, 1296, 1014888, 509446, 205065, 84035, 36015, 16807, 166537616, 59409952, 17393152, 5393920, 1863680, 688128, 262144, 50680432112, 12321597708, 2516756508, 563570217, 148803480, 45467730
Offset: 1

Views

Author

Gus Wiseman, Aug 03 2018

Keywords

Examples

			Triangle begins:
        1
        1       3
       10      12      16
      238     215     150     125
    11368    7740    4140    2160    1296
  1014888  509446  205065   84035   36015   16807
		

Crossrefs

Row sums are A001187. First column is A013922. Last column is A000272.

Programs

  • Mathematica
    blg={0,1,1,10,238,11368,1014888,166537616,50680432112,29107809374336} (*A013922*);
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    Table[Sum[n^(k-1)*Product[blg[[Length[s]+1]],{s,spn}],{spn,Select[sps[Range[n-1]],Length[#]==k&]}],{n,Length[blg]},{k,n-1}]