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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A347793 Intersection of Beatty sequences for 2^(1/3) and 2^(2/3). 3
 0, 1, 3, 6, 7, 11, 12, 15, 17, 20, 22, 23, 25, 26, 28, 30, 31, 34, 36, 39, 41, 42, 44, 46, 47, 49, 50, 52, 55, 57, 60, 61, 65, 66, 68, 69, 71, 73, 74, 76, 79, 80, 84, 85, 88, 90, 93, 95, 98, 100, 103, 104, 107, 109, 112, 114, 115, 117, 119, 120, 122, 123 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Let d(n) = a(n) - 2n. Conjecture: (d(n)) is unbounded below and above, and d(n) = 0 for infinitely many n. In general, if r and s are irrational numbers greater than 1, and a(n) is the n-th term of the intersection of the Beatty sequences for r and s, then a(n) = floor(r*ceiling(a(n)/r)) = floor(s*ceiling(a(n)/s)). LINKS EXAMPLE Beatty sequence for 2^(1/3): (0,1,2,3,5,6,7,8,10,11,...) Beatty sequence for 2^(2/3): (0,1,3,4,6,7,9,11,12,,...) Intersection = (0,1,3,6,7,11,12,...). MATHEMATICA z = 200; r = 2^(1/3); s = 2^(2/3); u = Table[Floor[n r], {n, 0, z}]; (* A038129 *) v = Table[Floor[n s], {n, 0, z}]; (* A347792 *) Intersection[u, v] (* A347793 *) CROSSREFS Cf. A038129, A347792. Sequence in context: A269178 A120511 A176864 * A306718 A022550 A237883 Adjacent sequences: A347790 A347791 A347792 * A347794 A347795 A347796 KEYWORD nonn AUTHOR Clark Kimberling, Nov 01 2021 STATUS approved

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.

Last modified November 30 04:37 EST 2022. Contains 358431 sequences. (Running on oeis4.)