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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004135 Additive bases: a(n) is the least integer k such that in the cyclic group Z_k there is a subset of n elements all pairs (of distinct elements) of which add up to a different sum (in Z_k).
(Formerly M0782)
7

%I M0782 #39 Feb 02 2020 20:09:33

%S 1,2,3,6,11,19,28,40,56,72,96,114,147,178,183,252,255

%N Additive bases: a(n) is the least integer k such that in the cyclic group Z_k there is a subset of n elements all pairs (of distinct elements) of which add up to a different sum (in Z_k).

%C From _Fausto A. C. Cariboni_, Oct 08 2017: (Start)

%C Lexicographically first basis that yields a(n) for n=16:

%C a(16) = 252 from {0,1,2,4,32,47,54,65,94,120,128,145,169,196,217,240}

%C (End)

%C From _Fausto A. C. Cariboni_, Mar 12 2018: (Start)

%C Lexicographically first basis that yields a(n) for n=17:

%C a(17) = 255 from {0,1,2,4,8,16,27,32,54,64,99,108,128,141,177,198,216}

%C (End)

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

%H Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, arXiv:1705.07444 [math.NT], May 2017. See Problem C.61.

%H R. L. Graham and N. J. A. Sloane, <a href="http://dx.doi.org/10.1137/0601045">On Additive Bases and Harmonious Graphs</a>, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.

%H R. L. Graham and N. J. A. Sloane, <a href="http://neilsloane.com/doc/RLG/073.pdf">On Additive Bases and Harmonious Graphs</a>

%H H. Haanpaa, A. Huima and Patric R. J. Östergård, <a href="https://doi.org/10.1016/S0166-218X(03)00273-7">Sets in Z_n with Distinct Sums of Pairs</a>, in Optimal discrete structures and algorithms (ODSA 2000). Discrete Appl. Math. 138 (2004), no. 1-2, 99-106.

%H H. Haanpaa, A. Huima and Patric R. J. Östergård, <a href="/A004135/a004135.pdf">Sets in Z_n with Distinct Sums of Pairs</a>, in Optimal discrete structures and algorithms (ODSA 2000). Discrete Appl. Math. 138 (2004), no. 1-2, 99-106. [Annotated scanned copies of four pages only from preprint of paper]

%H Z. Skupien, A. Zak, Pair-sums packing and rainbow cliques, in <a href="http://www.math.uiuc.edu/~kostochk/Zykov90-Topics_in_Graph_Theory.pdf">Topics In Graph Theory</a>, 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) [gives the term 183].

%e a(4)=6: the set {0,1,2,4} is such a subset of Z_6, since 0+1, 0+2, 0+4, 1+2, 1+4 and 2+4 are all distinct in Z_6; also, no such 4-element set exists in any smaller cyclic group.

%Y Cf. A004136, A004133, A260998, A260999.

%K nonn,nice,more

%O 1,2

%A _N. J. A. Sloane_

%E More terms and comments from Harri Haanpaa (Harri.Haanpaa(AT)hut.fi), Nov 01 2000

%E a(16) from _Fausto A. C. Cariboni_, Oct 08 2017

%E a(17) from _Fausto A. C. Cariboni_, Mar 12 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)