login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196094 a(n) = A001212(n) + 1. 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], 2013-2014.

W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

CROSSREFS

Cf. A001212, A123509, A234941.

A row or column of the array A196416 (possibly with 1 subtracted from it).

Sequence in context: A138008 A063954 A123509 * A063915 A183859 A096228

Adjacent sequences:  A196091 A196092 A196093 * A196095 A196096 A196097

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Sep 27 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 12:38 EDT 2019. Contains 324152 sequences. (Running on oeis4.)