|
%I M2661 #11 May 22 2017 19:19:33
%S 1,3,7,17,31,42,54,122,143,167,211,258,414,469,525,582,640,699,759,
%T 820,882,945,1009,1075,1458,1539,1621
%N From a partition of the integers.
%C Let S(n) be an infinite collection of sets partitioning the integers. An integer, m, is in S(n), if n is the largest integer such that m is expressible as a sum of n distinct integers from one of the sets S(n). a(n) is the least member of S(n). - _Sean A. Irvine_, May 22 2017
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H H. N. Shapiro, <a href="http://dx.doi.org/10.1007/BFb0062714">A combinatorial problem in additive number theory</a>, pp. 265-282 of Number Theory Carbondale 1979, Lect. Notes Math. 751 (1982).
%K nonn
%O 1,2
%A _N. J. A. Sloane_.
|
