cp's OEIS Frontend

A249124 Position of 2*n^6 in the ordered union of {h^6, h >= 1} and {2*k^6, k >= 1}.

%I A249124 #13 Aug 22 2019 05:35:14
%S A249124 2,4,6,8,10,12,14,16,19,21,23,25,27,29,31,33,36,38,40,42,44,46,48,50,
%T A249124 53,55,57,59,61,63,65,67,70,72,74,76,78,80,82,84,87,89,91,93,95,97,99,
%U A249124 101,104,106,108,110,112,114,116,118,120,123,125,127,129,131
%N A249124 Position of 2*n^6 in the ordered union of {h^6, h >= 1} and {2*k^6, k >= 1}.
%C A249124 Let S = {h^6, h >= 1} and T = {2*k^6, k >= 1}.  Then S and T are disjoint, and their ordered union is given by A249073.  The position of n^6 is A249123(n), and the position of 2*n^6 is A249124(n).  Also, a(n) is the position of n*2^(1/6) in the joint ranking of the positive integers and the numbers k*2^(1/6), so that A249123 and A249124 are a pair of Beatty sequences.
%C A249124 Every positive integer m is of the form k + floor( (2*k^6)^(1/6) ) (this sequence) or of the form k + floor( (k^6 / 2)^(1/6) ) (A249123) for some positive integer k but not both. - _David A. Corneth_, Aug 12 2019
%H A249124 David A. Corneth, <a href="/A249124/b249124.txt">Table of n, a(n) for n = 1..10000</a>
%F A249124 a(n) = n + floor( (2*n^6)^(1/6) ). - _David A. Corneth_, Aug 11 2019
%e A249124 {h^6, h >= 1} = {1, 64, 729, 4096, 15625, 46656, 117649, ...};
%e A249124 {2*k^6, k >= 1} = {2, 128, 1458, 8192, 31250, 93312, ...};
%e A249124 so the ordered union is {1, 2, 64, 128, 729, 1458, 4096, 8192, 15625, ...}, and
%e A249124 a(2) = 4 because 2*2^6 is in position 4.
%t A249124 z = 200; s = Table[h^6, {h, 1, z}]; t = Table[2*k^6, {k, 1, z}]; u = Union[s, t];
%t A249124 v = Sort[u]  (* A249073 *)
%t A249124 m = Min[120, Position[v, 2*z^2]]
%t A249124 Flatten[Table[Flatten[Position[v, s[[n]]]], {n, 1, m}]]  (* A249123 *)
%t A249124 Flatten[Table[Flatten[Position[v, t[[n]]]], {n, 1, m}]]  (* A249124 *)
%o A249124 (PARI) a(n) = n + sqrtnint(2*n^6, 6) \\ _David A. Corneth_, Aug 11 2019
%Y A249124 Cf. A249073, A249123.
%K A249124 nonn,easy
%O A249124 1,1
%A A249124 _Clark Kimberling_, Oct 21 2014