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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Nov 14 2020 02:00:39
%S 1,5,13,25,45,72,115,166,235,327,428,548,709,874,1095,1384,1651,1936,
%T 2305,2783,3325,3813,4369,5131,5893,6746,7881,8914,9920,11082,12377,
%U 13933,15658,17243,18893,21062,23446,25554,27979,31348,33982,36807,39915,43593
%N a(n) = A001209(n) + 1.
%C Lunnon sometimes works with this sequence rather than A001209. A001209 is the main entry.
%H Hakan Icoz, <a href="/A196069/b196069.txt">Table of n, a(n) for n = 0..54</a>
%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. A001209.
%Y A row or column of the array A196416 (possibly with 1 subtracted from it).
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Sep 27 2011
%E More terms from _Hakan Icoz_, Nov 13 2020