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 A175797 #37 Jul 20 2019 13:55:39 %S A175797 0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,3,3,3,3,3,3,3,3,3,3,3,3,3,3,12,12,7,3, %T A175797 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,48,48,35,31,27,12,7, %U A175797 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,12,12,12,7,3,3,3,3 %N A175797 Size of the largest holes in the toothpick structure of A182840 after step n. %C A175797 Each connected group of unoccupied lines in the hexagonal structure enclosed by toothpicks counts as a hole. %H A175797 Olaf Voß, <a href="/A175797/b175797.txt">Table of n, a(n) for n = 0..625</a> %H A175797 N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a> %H A175797 Olaf Voß, <a href="/wiki/Toothpick_structures_on_hexagonal_net">Toothpick structures on hexagonal net</a> %H A175797 <a href="/index/To#toothpick">Index entries for sequences related to toothpick sequences</a> %e A175797 Structure after step 8: %e A175797 \_/ %e A175797 \_/ \_/ %e A175797 \_/ \_/ \_/ %e A175797 \_/ _/ \_ \_/ %e A175797 / \_/ \_/ \_/ \ %e A175797 \_/ \_/ \_/ \_/ %e A175797 / \ / \_/ \ / \ %e A175797 \_/ \_/ \_/ \_/ %e A175797 / \_/ \_/ \_/ \ %e A175797 \_/ \_/ \_/ \_/ %e A175797 / \_ \_/ _/ \ %e A175797 / \_/ \_/ \ %e A175797 / \_/ \ %e A175797 / \ %e A175797 There are 6 holes in this structure, in each 1 toothpick is missing (size=1), so a(8)=1. %Y A175797 For number of holes see A184408. %K A175797 nonn %O A175797 0,16 %A A175797 _Olaf Voß_, Jan 13 2011