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 A196094 #23 Jan 25 2020 18:36:53 %S A196094 1,3,5,9,13,17,21,27,33,41,47,55,65,73,81,93,105,117,129,141,153,165, %T A196094 181,197,213 %N A196094 a(0) = 1; a(n) = A001212(n) + 1 for n > 0. %C A196094 Lunnon sometimes works with this sequence rather than A001212. A001212 is the main entry. %H A196094 J. Kohonen, J. Corander, <a href="http://arxiv.org/abs/1310.7090">Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications</a>, arXiv preprint arXiv:1310.7090 [math.NT], 2013-2014. %H A196094 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. %Y A196094 Cf. A001212, A123509, A234941. %Y A196094 Row m=2 of the array A196416. %K A196094 nonn,more %O A196094 0,2 %A A196094 _N. J. A. Sloane_, Sep 27 2011 %E A196094 Definition amended by _Georg Fischer_, Jan 25 2020