login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Rectangular array (T(n,k)), by downward antidiagonals: T(n,k) = position of k in the ordering of {h*e^m, h >= 1, 0 <= m <= n}.
5

%I #7 Nov 20 2021 21:24:53

%S 1,2,1,4,2,1,5,4,2,1,6,5,4,2,1,8,6,5,4,2,1,9,8,6,5,4,2,1,10,9,8,6,5,4,

%T 2,1,12,11,9,8,6,5,4,2,1,13,13,11,9,8,6,5,4,2,1,15,14,13,11,9,8,6,5,4,

%U 2,1,16,16,14,13,11,9,8,6,5,4,2,1,17,17

%N Rectangular array (T(n,k)), by downward antidiagonals: T(n,k) = position of k in the ordering of {h*e^m, h >= 1, 0 <= m <= n}.

%C No two rows are identical.

%e m = 0 gives 1, 2, 3, 4, 5, 6, ...

%e m = 1 gives e, 2e, 3e, 4e, 5e, ...

%e Row 1 of the array tells the positions of the positive integers when the numbers for m=0 and m=1 are jointly ranked. Using decimal approximations, the numbers, jointly ranked, are 1, 2, 2.718, 3, 4, 5, 6.436, 6, 7, 8, 8.154, 9, 10, 10.873, 11, ...

%e Corner:

%e 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 15, 16, 17

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%e 1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 16, 17, 18

%t z = 100; r = N[E];

%t s[m_] := Range[z] r^m; t[0] = s[0];

%t t[n_] := Sort[Union[s[n], t[n - 1]]]

%t row[n_] := Flatten[Table[Position[t[n], N[k]], {k, 1, z}]]

%t TableForm[Table[row[n], {n, 1, 10}]] (* A347069, array *)

%t w[n_, k_] := row[n][[k]];

%t Table[w[n - k + 1, k], {n, 12}, {k, n, 1, -1}] // Flatten (* A347069, sequence *)

%Y Cf. A347065, A347066, A347067, A347068.

%K nonn,tabl

%O 1,2

%A _Clark Kimberling_, Sep 02 2021