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 A075060 #19 Feb 16 2025 08:32:47 %S A075060 10,40,146,427,1055,2510,5047 %N A075060 a(n) = solution to the postage stamp problem with n denominations and 10 stamps. %C A075060 _Fred Lunnon_ [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps. %D A075060 R. K. Guy, Unsolved Problems in Number Theory, C12. %H A075060 R. Alter and J. A. Barnett, <a href="http://www.jstor.org/stable/2321610">A postage stamp problem</a>, Amer. Math. Monthly, 87 (1980), 206-210. %H A075060 M. F. Challis and J. P. Robinson, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL13/Challis/challis6.html">Some Extremal Postage Stamp Bases</a>, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010] %H A075060 Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0403.html">Postage stamp problem</a> %H A075060 W. F. Lunnon, <a href="https://doi.org/10.1093/comjnl/12.4.377">A postage stamp problem</a>, Comput. J. 12 (1969) 377-380. %H A075060 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PostageStampProblem.html">Postage stamp problem</a> %Y A075060 Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193. %K A075060 nonn,more %O A075060 1,1 %A A075060 _N. J. A. Sloane_, Jun 20 2003 %E A075060 Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004 %E A075060 a(7) from Challis and Robinson by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010