|
%I #28 Dec 21 2021 23:50:43
%S 4,2,6,2,7,4,8,7,9,2,10,6,6,2,11,9,12,7,13,8,13,12,8,9,14,11,15,2,16,
%T 6,2,11,16,14,6,9,17,8,18,12,19,13,18,17,12,9,19,6,13,14,20,16,21,11,
%U 22,2,16,14,21,13,11,6,22,19,2,9,23,12,24,17,25,18,23,2,12,19,24,22,17,6
%N Active part of Kimberling's expulsion array as a triangular array.
%C Active or shuffle part of Kimberling's expulsion array (A035486) is given by the elements K(i,j), where j < 2*i-3. [_Enrique Pérez Herrero_, Apr 14 2010]
%D R. K. Guy, Unsolved Problems Number Theory, Sect. E35.
%H Enrique Pérez Herrero, <a href="/A035505/b035505.txt">Table of n, a(n) for n = 1..10000</a>
%H Clark Kimberling, <a href="https://cms.math.ca/crux/backfile/Crux_v17n02_Feb.pdf">Problem 1615</a>, Crux Mathematicorum, Vol. 17 (2) 44 1991; <a href="https://cms.math.ca/crux/backfile/Crux_v18n03_Mar.pdf">Solution to Problem 1615</a>, Crux Mathematicorum, Vol. 18, March 1992, p. 82-83.
%F From _Enrique Pérez Herrero_, Apr 14 2010: (Start)
%F a(n) = K(A000194(n)+2, A074294(n)), where
%F K(i,j) = i + j - 1; (j >= 2*i - 3)
%F K(i,j) = K(i-1, i-(j+2)/2) if j is even and j < 2*i - 3
%F K(i,j) = K(i-1, i+(j-1)/2); if j is odd and j < 2*i - 3.
%F (End)
%e 4 2; 6 2 7 4; 8 7 9 2 10 6; ...
%t A000194[n_] := Floor[(1 + Sqrt[4 n - 3])/2];
%t A074294[n_] := n - 2*Binomial[Floor[1/2 + Sqrt[n]], 2];
%t K[i_, j_] := i + j - 1 /; (j >= 2 i - 3);
%t K[i_, j_] := K[i - 1, i - (j + 2)/2] /; (EvenQ[j] && (j < 2 i - 3));
%t K[i_, j_] := K[i - 1, i + (j - 1)/2] /; (OddQ[j] && (j < 2 i - 3));
%t A035505[n_] := K[A000194[n] + 2, A074294[n]]
%t (* _Enrique Pérez Herrero_, Apr 14 2010 *)
%Y Cf. A006852, A007063, A038807, A035486.
%Y Cf. A175312, A074294, A000194, A006852, A007063. [_Enrique Pérez Herrero_, Apr 14 2010]
%K nonn,tabf,nice,easy
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _James A. Sellers_, Dec 23 1999
|
