A380817 a(n) = A379343(A380245(n)).

1, 2, 3, 4, 5, 6, 9, 10, 7, 8, 11, 12, 13, 14, 15, 20, 21, 18, 19, 16, 17, 22, 23, 24, 25, 26, 27, 28, 35, 36, 33, 34, 31, 32, 29, 30, 37, 38, 39, 40, 41, 42, 43, 44, 45, 54, 55, 52, 53, 50, 51, 48, 49, 46, 47, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66

Offset: 1

Author

Boris Putievskiy, Feb 04 2025

Keywords

• nonn
• tabf

Comments

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.

The sequence can also be regarded as a table read by upward antidiagonals. For n>1, row n joins two consecutive antidiagonals.

The sequence is a self-inverse permutation of the positive integers.

In particular, the initial {a(1), a(2), ..., a(A000384(n+1))} is self-inverse.

The sequence is an intra-block permutation of the positive integers.

Generalization of the Cantor numbering method.

A379343 and A378684 generate via composition a finite non-abelian group of permutations of positive integers, isomorphic to the alternating group A4. The list of the 12 elements of that group: this sequence, A000027 (the identity permutation), A381662, A376214, A379343, A380200, A378684, A379342, A380245, A381664, A380815, A381663. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Apr 17 2025

This sequence and A381968 generate via composition a finite non-abelian group of permutations of positive integers, isomorphic to the dihedral group D4. The list of the 8 elements of that group: this sequence, A000027 (the identity permutation), A381968, A381662, A382499, A382679, A376214, A382680. For subgroups and the Cayley table of the group D4 see Putievskiy (D4 (I)) link. - Boris Putievskiy, Jun 09 2025

This sequence, A378762 and A381968 generate via composition a finite non-abelian group of permutations of positive integers, isomorphic to the direct product of the dihedral group D4 and the cyclic group C2. The list of the 16 elements of that group: this sequence, A000027 (the identity permutation), A381968, A381662, A382499, A382679, A376214, A382680, A378762, A383419, A383589, A383590, A056023, A383722, A383723, A383724. For subgroups and the Cayley table of the group D4xC2 see Putievskiy link. - Boris Putievskiy, Jun 09 2025

Examples

			Triangle array begins:
  k=    1   2   3  4   5   6   7   8   9
  n=1:  1;
  n=2:  2,  3,  4, 5,  6;
  n=3:  9, 10,  7, 8, 11, 12, 13, 14, 15;
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  3,  6,  8, 15, ...
   2,  5,  7, 14, 16, ...
   4, 10, 13, 19, 26, ...
   9, 12, 18, 25, 31, ...
  11, 21, 24, 34, 41, ...
  ...
Subtracting (n-1)*(2*n-3) from each term in row n produces a permutation of numbers from 1 to 4*n-3:
  1,
  1, 2, 3, 4, 5;
  3, 4, 1, 2, 5, 6, 7, 8, 9.
All permutations are self-inverse.
		

Links

• Boris Putievskiy, Table of n, a(n) for n = 1..9730
• Boris Putievskiy, Integer Sequences: Irregular Arrays and Intra-Block Permutations, arXiv:2310.18466 [math.CO], 2023.
• Boris Putievskiy, The Alternating Group A4: Subgroups and the Cayley Table (2025).
• Boris Putievskiy, The Dihedral Group D4 (I): Subgroups and the Cayley Table (D4 (I)).
• Boris Putievskiy, The Direct Product D4xC2: Subgroups and the Cayley Table.
• Groupprops, Subgroup structure of direct product of D8 and Z2.
• Eric Weisstein's World of Mathematics, Alternating Group.
• Eric Weisstein's World of Mathematics, Dihedral Group D_4.
• Index entries for sequences that are permutations of the natural numbers.

Crossrefs

Cf. A000027, A000384, A016813 (row lengths), A056023, A376214, A378684, A378762, A379342, A379343, A380200, A380245, A380815, A381662, A381663, A381664, A381968, A382499, A382679, A382680, A383419, A383589, A383590, A383722, A383723, A383724.

Programs

Mathematica

T[n_,k_]:=(n-1)*(2*n-3)+Module[{m=2*n-1},If[k
				

Formula

For 1 <= k <= 4n - 3, T(n,k) = A000384(n-1) + P(n,k), P(n,k) = -k + m - 1 if k < m and k == 1 (mod 2), P(n,k) = -k + m + 1 if k < m and k == 0 (mod 2), P(n,k) = k if k >= m, where m = 2*n - 1.

Extensions

Name corrected by Pontus von Brömssen, Jun 24 2025