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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A196069 a(n) = A001209(n) + 1. 3
 1, 5, 13, 25, 45, 72, 115, 166, 235, 327, 428, 548, 709, 874, 1095, 1384, 1651, 1936, 2305, 2783, 3325, 3813, 4369, 5131, 5893, 6746, 7881, 8914, 9920, 11082, 12377, 13933, 15658, 17243, 18893, 21062, 23446, 25554, 27979, 31348, 33982, 36807, 39915, 43593 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Lunnon sometimes works with this sequence rather than A001209. A001209 is the main entry. LINKS Hakan Icoz, Table of n, a(n) for n = 0..54 W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380. CROSSREFS Cf. A001209. A row or column of the array A196416 (possibly with 1 subtracted from it). Sequence in context: A147031 A147220 A269713 * A147182 A146175 A146851 Adjacent sequences: A196066 A196067 A196068 * A196070 A196071 A196072 KEYWORD nonn AUTHOR N. J. A. Sloane, Sep 27 2011 EXTENSIONS More terms from Hakan Icoz, Nov 13 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.

Last modified December 2 23:01 EST 2023. Contains 367526 sequences. (Running on oeis4.)