login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A276871
Sums-complement of the Beatty sequence for sqrt(5).
19
1, 10, 19, 28, 37, 48, 57, 66, 75, 86, 95, 104, 113, 124, 133, 142, 151, 162, 171, 180, 189, 198, 209, 218, 227, 236, 247, 256, 265, 274, 285, 294, 303, 312, 323, 332, 341, 350, 359, 370, 379, 388, 397, 408, 417, 426, 435, 446, 455, 464, 473, 484, 493, 502
OFFSET
1,2
COMMENTS
The sums-complement of a sequence s(1), s(2), ... of positive integers is introduced here as the set of numbers c(1), c(2), ... such that no c(n) is a sum s(j)+s(j+1)+...+s(k) for any j and k satisfying 1 <= j <= k. If this set is not empty, the term "sums-complement" also applies to the (possibly finite) sequence of numbers c(n) arranged in increasing order. In particular, the difference sequence D(r) of a Beatty sequence B(r) of an irrational number r > 2 has an infinite sums-complement, abbreviated as SC(r) in the following table:
r B(r) D(r) SC(r)
----------------------------------------------------
2+sqrt(1/2) A182769 A276869 A276888
sqrt(2)+sqrt(3) A110117 A276870 A276889
From Jeffrey Shallit, Aug 15 2023: (Start)
Simpler description: this sequence represents those positive integers that CANNOT be expressed as a difference of two elements of A022839.
There is a 20-state Fibonacci automaton for the terms of this sequence (see a276871.pdf). It takes as input the Zeckendorf representation of n and accepts iff n is a member of A276871. (End)
LINKS
EXAMPLE
The Beatty sequence for sqrt(5) is A022839 = (0,2,4,6,8,11,13,15,...), with difference sequence s = A081427 = (2,2,2,2,3,2,2,2,3,2,...). The sums s(j)+s(j+1)+...+s(k) include (2,3,4,5,6,7,8,9,11,12,...), with complement (1,10,19,28,37,...).
MATHEMATICA
z = 500; r = Sqrt[5]; b = Table[Floor[k*r], {k, 0, z}]; (* A022839 *)
t = Differences[b]; (* A081427 *)
c[k_, n_] := Sum[t[[i]], {i, n, n + k - 1}];
u[k_] := Union[Table[c[k, n], {n, 1, z - k + 1}]];
w = Flatten[Table[u[k], {k, 1, z}]]; Complement[Range[Max[w]], w]; (* A276871 *)
CROSSREFS
Sequence in context: A097153 A017173 A326833 * A247465 A349548 A088410
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Sep 24 2016
STATUS
approved