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 A352367 #27 Mar 05 2023 19:43:55 %S A352367 1,1,2,6,23,105,552,3276,21632,157058,1241542,10599358,97078720, %T A352367 948631866,9844060930,108045790170,1249891268947,15192207346713, %U A352367 193489732812832,2575819322454708,35763019798305487,516830453606687539,7760160395056532042,120860540786892879030 %N A352367 Row sums of A352366. %C A352367 a(n) is the number of chordal graphs with fixed symmetric perfect elimination ordering; i.e., graphs on V = [n] such that 1,...,n and n,...,1 are perfect elimination orderings. - _Robert Lauff_, Jan 25 2023 %C A352367 a(n) is the number of labeled unit-interval-graphs. This is because connected labeled unit-interval-graphs are a Catalan family. Given a partition of [n], we draw a connected unit-interval-graph for each of the partition classes. This weights the partitions with a Catalan number. The connection to my previous comment can be shown by induction. - _Robert Lauff_, Feb 01 2023 %H A352367 Wikipedia, <a href="https://en.wikipedia.org/wiki/Chordal_graph#Perfect_elimination_and_efficient_recognition">Chordal graph</a>. %Y A352367 Cf. A000108, A352366. %K A352367 nonn %O A352367 0,3 %A A352367 _Peter Luschny_, Mar 15 2022