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!)
 A347469 For irrational r > 1, let B(r) denote the Beatty sequence for r. Let (s(n)) be the increasing sequence of numbers in both B(sqrt(2)) and B(sqrt(3)). Then this sequence gives the numbers k such that s(k) = floor(k*sqrt(6)). 5
 1, 20, 21, 23, 49, 70, 71, 72, 73, 74, 75, 76, 78, 98, 101, 102, 117, 148, 194, 215, 216, 250, 257, 262, 299, 300, 307, 310, 344, 346, 357, 360, 361, 448, 1071, 1075, 1083, 1114, 1143, 1160, 1203, 1681, 1722, 1725, 1727, 1737, 1740, 1741, 1770, 1771, 1783 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS It is conjectured that this sequence is infinite. LINKS EXAMPLE (B(sqrt(2)) and B(sqrt(3))) - B(sqrt(6)) = (0, -1, 1, 1, 3, 3, 5, 5, 5, 3, 5, 5, 3, 5, 4, 3, 2, 2, 1, 0, 0, -1, 0, -1, -1, -1, -1, -1, -1, -2, ...), so that a(4) = 23, the position of the 4th 0. MATHEMATICA z = 10000; r = Sqrt[2]; s = Sqrt[3]; u = Table[Floor[n r], {n, 0, z}]; (*A001951*) v = Table[Floor[n s], {n, 1, z}]; (*A022838*) w = Intersection[u, v]; (*A346308*) zz = -1 + Length[w]; t = Table[Floor[n*r*s], {n, 0, zz}]; (* A022840 *) d = w - t; Flatten[Position[d, 0]] (* A347469 *) CROSSREFS Cf. A001951, A022838, A022840, A346308, A347467, A347468. Sequence in context: A346400 A347298 A326678 * A030605 A063780 A125663 Adjacent sequences: A347466 A347467 A347468 * A347470 A347471 A347472 KEYWORD nonn AUTHOR Clark Kimberling, Oct 31 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 05:38 EST 2022. Contains 358431 sequences. (Running on oeis4.)