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 A304199 #22 Jun 02 2018 04:27:33 %S A304199 1,1,2,2,3,2,2,1,1,6,602,324,148,48,16,3,1,186,30,6,1 %N A304199 Number of fully-leafed free tree-like 4d-polycubes of size n. %C A304199 A free tree-like polycube of size n in four dimensions is a hyperface-connected set of n cells in the 4d-hypercubic 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 4d-polycubes. %H A304199 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 A304199 Cf. A304198 (free tree-like 4d-polycubes), A304195, A304197 (fully-leafed free tree-like polyominoes and 3d-polycubes resp.). %K A304199 nonn,more %O A304199 1,3 %A A304199 _Lotfi Bouallagui_, May 07 2018