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 A304197 #20 Jun 02 2018 04:27:38 %S A304197 1,1,2,2,2,1,1,4,100,42,16,3,1,31,1,989,164,17,2,384,10 %N A304197 Number of fully-leafed free tree-like 3d-polycubes of size n. %C A304197 A free tree-like polycube of size n in three dimensions is a face-connected set of n cells in the cubic lattice, up to translation, rotation and reflection, whose dual graph has no cycles. It is said to be fully-leafed when it has the maximal number of leaves over all the same sized free tree-like 3d-polycubes. %H A304197 Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, and Maxime Samson, <a href="https://doi.org/10.1007/978-3-319-78825-8_17">Fully-leafed tree-like polyominoes and polycubes</a>, In Combinatorial algorithms, volume 10765 of Lecture Notes of Computer Science, 28th International workshop, IWOCA 2017, Newcastle, NSW, Australia, Springer, 2018. %Y A304197 Cf. A304196 (free tree-like 3d-polycubes), A304195, A304199 (fully-leafed free tree-like polyominoes and 4d-polycubes resp.). %K A304197 nonn,more %O A304197 1,3 %A A304197 _Lotfi Bouallagui_, May 07 2018