A046693 Size of smallest subset S of N={0,1,2,...,n} such that S-S=N, where S-S={abs(i-j) | i,j in S}.
1, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16
Offset: 0
Examples
a(10)=6 since all integers in {0,1,2...10} are differences of elements of {0,1,2,3,6,10}, but not of any 5-element set. a(17)=7 since all integers in {0,1,2...17} are differences of elements of {0,1,8,11,13,15,17}, but not of any 6-element set. In other words, {0,1,8,11,13,15,17} is a restricted difference basis w.r.t. A004137(7)=17.
Links
- Ed Pegg Jr, Table of n, a(n) for n = 0..213
- Andrew Granville and Friedrich Roesler, The set of differences of a given set.
- Andrew Granville and Friedrich Roesler, The set of differences of a given set, Amer. Math. Monthly, 106 (1999), 338-344.
- J. Leech, On the representation of 1, 2, ..., n by differences, J. Lond. Math. Soc. 31 (1956), 160-169.
- Ed Pegg Jr, Best known values A046693(n)-round(sqrt(3*n+9/4)) up to 1750.
- Aleksi Saarela and Aleksi Vanhatalo, A Connection Between Unbordered Partial Words and Sparse Rulers, arXiv:2408.16335 [math.CO], 2024. See p. 17.
Programs
-
Mathematica
Prepend[Table[Round[Sqrt[3*n+9/4]]+If[MemberQ[A308766,n],1,0],{n,1,213}],1]
Comments