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 A196416 #14 Jul 10 2017 09:26:28 %S A196416 1,1,1,1,2,1,1,3,3,1,1,4,5,4,1,1,5,8,9,5,1,1,6,11,16,13,6,1,1,7,15,27, %T A196416 25,17,7,1,1,8,19,36,45,37,21,8,1,1,9,24,53,72,71,53,27,9,1,1,10,29, %U A196416 70,115,127,109,71,33,10,1 %N A196416 Table read by antidiagonals: V(n,m) = solution to postage stamp problem with n stamps in set, m stamps on letter. %C A196416 Given n, m, the postage stamp problem is to choose a set of n nonnegative integers such that the sums of m or fewer of these integers can realize the numbers 1, 2, ..., N-1, where N is as large as possible. V(n,m) denotes the value of N. %H A196416 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. %e A196416 Array begins: %e A196416 m\n 0 1 2 3 4 5 6 ... %e A196416 --------------------- %e A196416 0...1 1 1 1 1 1 1 ... %e A196416 1...1 2 3 4 5 6 7 ... %e A196416 2...1 3 5 9 13 17 21 ... %e A196416 3...1 4 8 16 25 37 53 ... %e A196416 4...1 5 11 27 45 71 109 ... %e A196416 5...1 6 15 36 72 127 212 ... %e A196416 6...1 7 19 53 115 217 389 ... %e A196416 ... %Y A196416 Rows and columns include: A014616/A024206, A195618/A001208, A196069/A001209, A001210, A001211, A196094/A001212, A001213, A001214, A001215, A001216. %K A196416 nonn,tabl %O A196416 0,5 %A A196416 _N. J. A. Sloane_, Oct 01 2011