|
%I #23 Jan 25 2020 18:36:53
%S 1,3,5,9,13,17,21,27,33,41,47,55,65,73,81,93,105,117,129,141,153,165,
%T 181,197,213
%N a(0) = 1; a(n) = A001212(n) + 1 for n > 0.
%C Lunnon sometimes works with this sequence rather than A001212. A001212 is the main entry.
%H 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 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 Cf. A001212, A123509, A234941.
%Y Row m=2 of the array A196416.
%K nonn,more
%O 0,2
%A _N. J. A. Sloane_, Sep 27 2011
%E Definition amended by _Georg Fischer_, Jan 25 2020
|
