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 A091240 #7 Jul 28 2017 23:32:14 %S A091240 1,2,4,11,47,319,3053,40345 %N A091240 Largest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n. %C A091240 Apparently from n=4 onward given by recurrence a(4) = A014580(4), a(5) = A014580(A014580(4)), a(6) = A014580(A014580(A014580(4))), etc. %H A091240 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %Y A091240 Analogous to A005518. A091239 gives the smallest i with number of nodes = n. Cf. A091230, A091238, A091241. %K A091240 nonn %O A091240 1,2 %A A091240 _Antti Karttunen_, Jan 03 2004