

A196094


a(0) = 1; a(n) = A001212(n) + 1 for n > 0.


3



1, 3, 5, 9, 13, 17, 21, 27, 33, 41, 47, 55, 65, 73, 81, 93, 105, 117, 129, 141, 153, 165, 181, 197, 213
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Lunnon sometimes works with this sequence rather than A001212. A001212 is the main entry.


LINKS

Table of n, a(n) for n=0..24.
J. Kohonen, J. Corander, Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications, arXiv preprint arXiv:1310.7090 [math.NT], 20132014.
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377380.


CROSSREFS

Cf. A001212, A123509, A234941.
Row m=2 of the array A196416.
Sequence in context: A138008 A063954 A123509 * A063915 A340520 A183859
Adjacent sequences: A196091 A196092 A196093 * A196095 A196096 A196097


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Sep 27 2011


EXTENSIONS

Definition amended by Georg Fischer, Jan 25 2020


STATUS

approved



