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 A094366 #11 Jul 14 2017 06:11:47
%S A094366 1,1,2,2,1,3,2,1,3,3,1,4,2,2,4,3,1,3,2,2,4,3,1,5,3,2,4,3,1,6,2,2,4,3,
%T A094366 2,6,2,1,3,5,1,6,2,2,6,3,1,5,3,2,4,4,1,6,4,3,4,2,1,7,2,2,5,4,2,6,2,1,
%U A094366 4,6,1,7,2,2,6,4,2,5,2,3,4,3,1,8,4,2,4,4,1,9,4,2,4,3,2,7,2,2,6,6,1,5,2,3,7
%N A094366 a(n) is the number of two-generated numerical semigroups whose Frobenius number is 2n-1.
%C A094366 A numerical semigroup is a set of natural numbers closed under addition. Its Frobenius number is the largest number not in it. In the case of a semigroup generated by two relatively prime numbers a and b, its Frobenius number is ab-a-b, which is always odd.
%H A094366 David Wasserman, <a href="/A094366/b094366.txt">Table of n, a(n) for n = 1..300</a>
%H A094366 J. C. Rosales, P. A. Garcia-Sanchez and J. I. Garcia-Garcia, <a href="http://dx.doi.org/10.7146/math.scand.a-14427">Every positive integer is the Frobenius number of a numerical semigroup with three generators</a>, Math. Scand. 94 (2004), no. 1, 5-12.
%e A094366 a(9) = 3: the 3 semigroups generated by {2, 19}, {3, 10} and {4, 7} have Frobenius number 17.
%Y A094366 Cf. A094365, A094367.
%K A094366 easy,nonn
%O A094366 1,3
%A A094366 Corina Flynn (Corinamachina(AT)hotmail.com), May 07 2004
%E A094366 Edited and extended by _David Wasserman_, Sep 27 2006