A006628 From a partition of the integers. (Formerly M2661)

1, 3, 7, 17, 31, 42, 54, 122, 143, 167, 211, 258, 414, 469, 525, 582, 640, 699, 759, 820, 882, 945, 1009, 1075, 1458, 1539, 1621

Offset

1,2

Comments

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

References

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=1..27.

H. N. Shapiro, A combinatorial problem in additive number theory, pp. 265-282 of Number Theory Carbondale 1979, Lect. Notes Math. 751 (1982).

Crossrefs

Sequence in context: A083991 A228567 A123988 * A068682 A292446 A045425

Adjacent sequences: A006625 A006626 A006627 * A006629 A006630 A006631

Keyword

nonn

Author

N. J. A. Sloane.

Status

approved