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 A381814 #17 Mar 16 2025 10:37:21
%S A381814 2,5,20,8,56,56,74,180,660,220,2288,2002,2942,7280,24752,8568,93024,
%T A381814 77520,120920,298452,1009470,346104,3845600,3289000,5067974,12432420,
%U A381814 42921450,14307150,161280600,140244000,215188426,524512560,1835793960
%N A381814 Size of the largest component of the blet graph for n coins.
%C A381814 See A381813 for the definition of the blet graph.
%H A381814 Michael S. Branicky, <a href="/A381813/a381813.py.txt">Python program for OEIS A381813 and A381814</a>
%F A381814 a(2*n) >= A075273(n) (the size of the component containing the vertex (HT)^n).
%e A381814 For n = 4, the blet graph has 2 components of maximum size a(4) = 5: {TTTH, THTT, THHH, HTHT, HHTH} and {TTHT, THTH, HTTT, HTHH, HHHT}.
%o A381814 (Python) # see linked program
%Y A381814 Cf. A075273, A381812, A381813 (number of components of size at least 2).
%K A381814 nonn,more
%O A381814 3,1
%A A381814 _Pontus von Brömssen_, Mar 08 2025
%E A381814 a(24)-a(28) from _Michael S. Branicky_, Mar 08 2025
%E A381814 a(29)-a(30) from _Michael S. Branicky_, Mar 12 2025
%E A381814 a(31)-a(35) from _Bert Dobbelaere_, Mar 16 2025