A004133 Additive bases: a(n) is the least integer such that there is an n-element set of nonnegative integers, the sums of pairs (of distinct elements) of which are distinct and at most a(n).
1, 3, 6, 11, 19, 31, 43, 63, 80, 110, 138, 169, 202, 241, 288, 330
Offset: 2
References
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), pp. 382-404 (v_alpha).
- R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs [alternate link]
- Z. Skupien, A. Zak, Pair-sums packing and rainbow cliques, in Topics In Graph Theory, A tribute to A. A. and T. E. Zykovs on the occasion of A. A. Zykov's 90th birthday, ed. R. Tyshkevich, Univ. Illinois, 2013, pages 131-144, (in English and Russian).
Extensions
a(11) from R. J. Mathar, Mar 17 2007
Two more terms from Jon E. Schoenfield, Aug 24 2009
202 and 241 from Skupien et al. - N. J. A. Sloane, Nov 24 2013
a(16) from Lars Blomberg, Oct 31 2015
a(17) from Fausto A. C. Cariboni, Oct 24 2017
Comments