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 A357895 #8 Oct 21 2022 14:32:24 %S A357895 1,2,12,472,104800 %N A357895 Number of partitions of the complete graph on n vertices into strokes. %C A357895 Partition of graph G=(V,E) into strokes is a collection of directed edge-disjoint trails (viewed as sets of directed edges, cf. A357857) in G such that (i) no two trails can be concatenated into a single one; (ii) the corresponding undirected edges form a partition of E. %Y A357895 Cf. A089243, A131518, A131520, A354228, A131709, A357857. %K A357895 nonn,more,walk %O A357895 1,2 %A A357895 _Yasutoshi Kohmoto_ and _Max Alekseyev_, Oct 18 2022