login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195618 a(0) = 1; a(n) = A001208(n) + 1 for n > 0. 2
1, 4, 9, 16, 27, 36, 53, 70, 90, 113, 147, 173, 213, 260, 303, 355, 419, 477, 549, 634, 715, 806, 903, 1013, 1128, 1255, 1383, 1525, 1679, 1842, 2011, 2189, 2383, 2585, 2802, 3021, 3257, 3509, 3773, 4044, 4327, 4629, 4942, 5273, 5607, 5961, 6335, 6724, 7121 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

Table of n, a(n) for n=0..48.

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

CROSSREFS

Cf. A001208.

Column n=3 of the array A196416.

Sequence in context: A333417 A180306 A138994 * A066969 A213495 A109593

Adjacent sequences:  A195615 A195616 A195617 * A195619 A195620 A195621

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Sep 23 2011

EXTENSIONS

Definition amended by Georg Fischer, Jan 25 2020

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 15 02:47 EDT 2022. Contains 356122 sequences. (Running on oeis4.)