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 A304195 #24 Jun 02 2018 13:08:45 %S A304195 1,1,2,1,1,2,12,3,1,6,74,11,2,21,408,40,4,76,2053,148,11,279 %N A304195 Number of fully-leafed free tree-like polyominoes of size n. %C A304195 A free tree-like polyomino of size n is a connected set of n cells in the square lattice, up to translation, rotation and reflection, whose dual graph has no cycles. It is called fully-leafed when it has the maximal number of leaves over all the same sized free tree-like polyominoes. %H A304195 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. %e A304195 a(5) = 1: %e A304195 . # %e A304195 . ### %e A304195 . # %e A304195 a(6) = 2: %e A304195 . # . # %e A304195 . #### . #### %e A304195 . # . # %e A304195 a(7) = 12: %e A304195 . # # . # # . # # . # . # . # %e A304195 . ### . #### . ##### . ##### . ##### . ##### %e A304195 . # # . # . . # . # . # %e A304195 . %e A304195 . # # . # # . # . # . # . # %e A304195 . #### . #### . # . ## . ## . ##### %e A304195 . # . # . #### . ### . ### . # %e A304195 . . . # . # . # . %Y A304195 Cf. A131482 (free tree-like polyominoes), A304197, A304199 (fully-leafed free tree-like polycubes in 3 and 4 dimensions resp.). %K A304195 nonn,more %O A304195 1,3 %A A304195 _Lotfi Bouallagui_, May 07 2018