|
%I #17 Nov 07 2022 17:02:15
%S 2,3,5,7,8,10,12,14,15,17,19,20,22,24,25,27,29,31,32,34,36,37,39,41,
%T 43,44,46,48,49,51,53,54,56,58,60,61,63,65,66,68,70,72,73,75,77,78,80,
%U 82,84,85,87,89,90,92,94,95,97,99,101,102,104,106,107,109,111,113,114,116,118,119,121,123,124,126,128,130,131,133,135,136,138,140,142,143,145,147,148,150,152,153,155,157,159,160,162,164,165,167,169,171
%N Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and squares. Complement of A186222.
%C See A186219.
%H G. C. Greubel, <a href="/A186221/b186221.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = n + floor(sqrt((n^2+n)/2 + 1/4), A186221.
%F b(n) = n + floor(-1/2 + sqrt(2*n^2)), A186222.
%F a(n) = A061288(n) - n for all n in Z. - _Michael Somos_, Aug 19 2018
%e First, write
%e 1..3...6..10..15...21..28..36..45... (triangular)
%e 1....4...9......16...25....36....49.. (square)
%e Replace each number by its rank, where ties are settled by ranking the triangular number after the square:
%e a=(2,3,5,7,8,10,12,14,...)
%e b=(1,4,6,9,11,13,16,18,...).
%t (* adjusted joint ranking; general formula *)
%t d=-1/4; u=1/2; v=1/2; w=0; x=1; y=0; z=0;
%t h[n_]:=-y+(4x(u*n^2+v*n+w-z-d)+y^2)^(1/2);
%t a[n_]:=n+Floor[h[n]/(2x)];
%t k[n_]:=-v+(4u(x*n^2+y*n+z-w+d)+v^2)^(1/2);
%t b[n_]:=n+Floor[k[n]/(2u)];
%t Table[a[n],{n,1,100}] (* A186221 *)
%t Table[b[n],{n,1,100}] (* A186222 *)
%t a[ n_] := n + Floor[ Sqrt[ n (n + 1)/2]]; (* _Michael Somos_, Aug 19 2018 *)
%o (PARI) vector(120, n, n + floor(sqrt((n^2+n)/2 + 1/4))) \\ _G. C. Greubel_, Aug 18 2018
%o {a(n) = n + sqrtint( n * (n+1) \ 2)}; /* _Michael Somos_, Aug 19 2018 */
%o (Magma) [n + Floor(Sqrt((n^2+n)/2 + 1/4)): n in [1..120]]; // _G. C. Greubel_, Aug 18 2018
%Y Cf. A061288, A186219, A186220, A186222.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Feb 15 2011
|
