cp's OEIS Frontend

A383722 a(n) = A378762(A382679(n)).

%I A383722 #8 May 11 2025 21:57:11
%S A383722 1,5,3,6,2,4,14,8,12,10,15,9,13,7,11,27,17,25,19,23,21,28,20,26,18,24,
%T A383722 16,22,44,30,42,32,40,34,38,36,45,35,43,33,41,31,39,29,37,65,47,63,49,
%U A383722 61,51,59,53,57,55,66,54,64,52,62,50,60,48,58,46,56
%N A383722 a(n) = A378762(A382679(n)).
%C A383722 This sequence can be regarded as a triangular array read by rows. Each row is a permutation of a block of consecutive numbers; the blocks are disjoint and every positive number belongs to some block. The length of row n is 4n-3 = A016813(n-1), n > 0.
%C A383722 The sequence can also be regarded as a table read by upward antidiagonals. For n > 1 row n joins two consecutive antidiagonals.
%C A383722 The sequence is a self-inverse permutation of the positive integers.
%C A383722 In particular, the initial {a(1), a(2), ..., a(A000384(n+1))} is self-inverse.
%C A383722 The sequence is an intra-block permutation of the positive integers.
%C A383722 Generalization of the Cantor numbering method.
%H A383722 Boris Putievskiy, <a href="/A383722/b383722.txt">Table of n, a(n) for n = 1..9730</a>
%H A383722 Boris Putievskiy, <a href="https://arxiv.org/abs/2310.18466">Integer Sequences: Irregular Arrays and Intra-Block Permutations</a>, arXiv:2310.18466 [math.CO], 2023.
%H A383722 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>.
%F A383722 T(n,k) for 1 <= k <= 4n - 3: T(n,k) = A000384(n-1) + P(n,k), P(n, k) = 2m - 1 - k if k < m and k == 1 (mod 2), P(n, k) = k if k < m and k == 0 (mod 2), P(n, k) = 3m - 1 - k if k >= m and k == 1 (mod 2), P(n, k) = 2m - 1 - k if k >= m and k == 0 (mod 2), where m = 2n - 1.
%e A383722 Triangle array begins:
%e A383722   k=    1   2   3   4   5  6   7   8   9
%e A383722   n=1:  1;
%e A383722   n=2:  5,  3,  6,  2,  4;
%e A383722   n=3:  14, 8, 12, 10, 15, 9, 13, 7, 11;
%e A383722 (1, 5, 3, ..., 7, 11) = (1, 2, 3, ..., 12, 11) (1, 5, 3, ..., 7, 15). The first permutation on the right-hand side is from Example A378762 and the second from Example A382679.
%e A383722 (1, 5, 3, ..., 7, 11) = (1, 5, 3, ..., 7, 11)^(-1).
%e A383722 For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
%e A383722    1,  3,  4, 10, 11, ...
%e A383722    5,  2, 12,  7, 23, ...
%e A383722    6,  8, 13, 19, 24, ...
%e A383722   14,  9, 25, 18, 40, ...
%e A383722   15, 17, 26, 32, 41, ...
%e A383722   ...
%e A383722 Subtracting (n-1)*(2*n-3) from each term in row n produces a permutation of numbers from 1 to 4*n-3:
%e A383722   1;
%e A383722   4, 2, 5, 1, 3;
%e A383722   8, 2, 6, 4, 9, 3, 7, 1, 5.
%t A383722 T[n_,k_]:=(n-1)*(2*n-3)+Module[{m=2*n-1},If[k<m,If[OddQ[k],2m-1-k,k],If[OddQ[k],3m-1-k,2m-1-k]]]
%t A383722 Nmax=3; Flatten[Table[T[n,k],{n,1,Nmax},{k,1,4*n-3}]]
%Y A383722 Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379342, A379343, A380200, A380245, A380815, A380817, A381662, A381663, A381664, A381968, A382499, A382679, A382680.
%K A383722 nonn,tabf
%O A383722 1,2
%A A383722 _Boris Putievskiy_, May 07 2025