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 A098092 #7 Jul 10 2017 09:37:22 %S A098092 1,2,6,8,19,28,40,43,91,103 %N A098092 Unique solution to the [10,3] postage stamp problem (showing that V(10,3) = 155). %C A098092 This sequence supplemented the solutions listed in Lunnon's 1969 paper. The Math Magic link includes a more recent set of solutions. The Darts Contest link include more extensive sequences, but not necessarily solutions. %H A098092 Math Magic <a href="http://www.stetson.edu/%7Eefriedma/mathmagic/0403.html">Problem of the Month (April 2003)</a> %H A098092 W. F. Lunnon, <a href="http://dx.doi.org/10.1093/comjnl/12.4.377">A Postage Stamp Problem</a>, Comput. J. 12 (1969) 377-380. %H A098092 J. L. Seldon, <a href="https://doi.org/10.1093/comjnl/15.4.361-a">The Postage Stamp Problem</a>, Letter to the Editor dated Jun 07 1972, The Computer Journal, Volume 15 No 4 Page 361. %H A098092 Al Zimmermann <a href="http://members.aol.com/bitzenbeitz/Contests/Darts/FinalReport.html">Darts Contest (Final Report) </a> %Y A098092 Cf. A001213. %K A098092 fini,full,nonn %O A098092 0,2 %A A098092 John Seldon (johnseldon(AT)onetel.com), Sep 14 2004