A381662 -id:A381662 - cp's OEIS frontend

A381968 a(a(n)) = A381662(n).

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

Offset: 1

Boris Putievskiy, Mar 12 2025

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 an intra-block permutation of the positive integers.
Generalization of the Cantor numbering method.
This sequence and A380817 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, A382499 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, 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 A380817 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), A382499 (the inverse permutation), A381662, A380817, 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

			Triangle array begins:
  k=     1  2   3   4   5   6   7   8   9
  n=1:   1;
  n=2:   5, 3,  4,  2,  6;
  n=3:  14, 8, 12, 10, 11,  7, 13,  9, 15;
(1,5,3,...,9,15) (1,5,3,...,9,15) = (1,2,3,...,12,15). The permutation on the right-hand side is from Example A381662.
ord(1,5,3,...,9,15) = 4.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  3,  6, 10, 15, ...
   5,  2, 12,  9, 23, ...
   4,  8, 13, 19, 26, ...
  14,  7, 25, 18, 40, ...
  11, 17, 24, 32, 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;
  4, 2, 3, 1, 5;
  8, 2, 6, 4, 5, 1, 7, 3, 9.

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 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, Dihedral Group D_4.
Index entries for sequences that are permutations of the natural numbers.

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

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

ord(a(1), a(2), ..., a(A000384(n+1))) = 4, where ord is the order of the permutation.

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

A383589 a(n) = A378762(A381662(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, May 01 2025

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.

			Triangle array begins:
  k=    1   2  3  4   5   6   7   8   9
  n=1:  1;
  n=2:  2,  3, 6, 5,  4;
  n=3:  7, 10, 9, 8, 15, 12, 13, 14, 11;
(1, 2, 3, ..., 14, 11) = (1, 2, 3, ..., 12, 11) (1, 2, 3, ..., 12, 15). The first permutation on the right-hand side is from Example A378762 and the second from Example A381662.
(1, 2, 3, ..., 14, 11) = (1, 2, 3, ..., 14, 11)^(-1).
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  3,  4,  8, 11, ...
   2,  5,  9, 14, 20, ...
   6, 10, 13, 19, 24, ...
   7, 12, 18, 25, 33, ...
  15, 21, 26, 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, 5, 4, 3;
  1, 4, 3, 2, 9, 6, 7, 8, 5.

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.
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379342, A379343, A380200, A380245, A380815, A380817, A381662, A381663, A381664, A381968, A382499, A382679, A382680.

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

T(n,k) for 1 <= k <= 4n - 3: T(n,k) = A000384(n-1) + P(n,k), P(n, k) = k if k < m and k == 1 (mod 2), P(n, k) = m + 1 - 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) = k if k >= m and k == 0 (mod 2), where m = 2n - 1.

A378684 a(n) = A378200(A378200(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Dec 03 2024

The 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 an intra-block permutation of the positive integers.
Generalization of Cantor numbering method.
The sequence A378200 generates the cyclic group C6 under composition. The elements of C6 are the successive compositions of A378200 with itself: A378684(n) = A378200(A378200(n)) = A378200(n)^2, A378762(n) = A378200(n)^3, A379342(n) = A378200(n)^4, A378705(n) = A378200(n)^5. The identity element is A000027(n) = A378200(n)^6. - Boris Putievskiy, Jan 10 2025
This sequence and A379343 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, A379342 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A379343, A380200, A380245, A381664, A380815, A381663. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Mar 28 2025

			Triangle array begins:
  k=   1   2   3   4   5   6   7   8   9
  n=1: 1;
  n=2: 3,  5,  4,  2,  6;
  n=3: 8, 14, 10, 12, 11,  9, 13,  7, 15;
(1, 3, 5, ..., 7, 15) = (A378200(1), A378200(2),  A378200(3), ..., A378200(14), A378200(15))^2.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  5,  6, 12, 15, ...
   3,  2, 10,  7, 21, ...
   4, 14, 13, 25, 26, ...
   8,  9, 19, 18, 34, ...
  11, 27, 24, 42, 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;
  2, 4, 3, 1, 5;
  2, 8, 4, 6, 5, 3, 7, 1, 9.

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).
Eric Weisstein's World of Mathematics, Alternating Group.
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A379342, A379343, A380200, A380245, A380815, A380817, A381662, A381663, A381664.

Mathematica
```
P[n_,k_]:=Module[{m=2*n-1},If[k
				
```

Linear sequence: (a(1), a(2), ..., a(A000384(n+1))) is permutation of the positive integers from 1 to A000384(n+1). (a(1), a(2), ..., a(A000384(n+1))) = (A378200(1), A378200(2), ..., A378200(A000384(n+1)))^2.

Triangular array T(n,k) for 1 <= k <= 4n - 3 (see Example): T(n,k) = A000384(n-1) + P(n,k), P(n,k) = k + 1 if k < m and k == 1 (mod 2), P(n,k) = 2*m - k if k < m and k == 0 (mod 2), P(n,k) = k if k >= m and k == 1 (mod 2), P(n,k) = 2*m - k - 1 if k >= m and k == 0 (mod 2), where m = 2*n - 1.

A379342 a(n) = A378684(A378684(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Dec 21 2024

The 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 an intra-block permutation of the positive integers.
Generalization of Cantor numbering method.
The sequence A378200 generates the cyclic group C6 under composition. The elements of C6 are the successive compositions of A378200 with itself: A378684(n) = A378200(A378200(n)) = A378200(n)^2, A378762(n) = A378200(n)^3, A379342(n) = A378200(n)^4, A378705(n) = A378200(n)^5. The identity element is A000027(n) = A378200(n)^6. - Boris Putievskiy, Jan 03 2025
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, A378684 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A379343, A380200, A380245, A381664, A380815, A381663. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Mar 30 2025

			Triangle array begins:
  k=   1   2   3   4   5   6   7   8   9
  n=1: 1;
  n=2: 5,  2,  4,  3,  6;
  n=3: 14, 7, 12,  9, 11, 10, 13,  8, 15;
  ...
(1, 5, 2, ..., 8, 15) = (A378684(1), A378684(2), A378684(3), ..., A378684(14), A378684(15))^2.
(1, 5, 2, ..., 8, 15) = (A378684(1), A378684(2), A378684(3), ..., A378684(14), A378684(15))^(-1).
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  2,  6,  9, 15, ...
   5,  3, 12,  8, 23, ...
   4,  7, 13, 18, 26, ...
  14, 10, 25, 19, 40, ...
  11, 16, 24, 31, 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;
  4, 1, 3, 2, 5;
  8, 1, 6, 3, 5, 4, 7, 2, 9.

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).
Eric Weisstein's World of Mathematics, Alternating Group
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379343, A380200, A380245, A380815, A380817, A381662, A381663, A381664.

P[n_,k_]:=If[OddQ[k],Max[k,4 n-3-k],Min[k-1,4 n-2-k]]
Nmax=3;Flatten[Table[P[n,k]+(n-1)*(2*n-3),{n,1,Nmax},{k,1,4*n-3}]]

Linear sequence: (a(1), a(2), ..., a(A000384(n+1))) is a permutation of the positive integers from 1 to A000384(n+1). ord(a(1), a(2), ..., a(A000384(n+1))) = 3, where ord is the order of the permutation. (a(1), a(2), ..., a(A000384(n+1))) = (A378684(1), A378684(2), ..., A378684(A000384(n+1)))^(-1).

Triangular array T(n,k) for 1 <= k <= 4n - 3 (see Example): T(n,k) = A000384(n-1) + P(n,k), P(n,k) = max(k, 4n - 3 - k) if k == 1 (mod 2), P(n,k) = min(k - 1, 4n - 2 - k) if k == 0 (mod 2).

A379343 Square array read by upward antidiagonals: T(n,k) = (2(k+n-1)^2 + 2k - 2n + 3 + (-2k - 2n + 3)(-1)^n - (-1)^k + (-2k - 2n + 1)*(-1)^(k+n))/4.

Original entry on oeis.org

1, 3, 5, 4, 2, 6, 8, 12, 10, 14, 11, 7, 13, 9, 15, 17, 23, 19, 25, 21, 27, 22, 16, 24, 18, 26, 20, 28, 30, 38, 32, 40, 34, 42, 36, 44, 37, 29, 39, 31, 41, 33, 43, 35, 45, 47, 57, 49, 59, 51, 61, 53, 63, 55, 65, 56, 46, 58, 48, 60, 50, 62, 52, 64, 54, 66, 68, 80, 70, 82, 72, 84, 74, 86, 76, 88, 78, 90, 79, 67, 81, 69, 83, 71, 85, 73, 87, 75, 89, 77

Offset: 1

Boris Putievskiy, Dec 21 2024

The 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 an intra-block permutation of the positive integers.
Generalization of Cantor numbering method.
This sequence 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, A380200 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A378684, A379342, A380245, A381664, A380815, A381663. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Mar 11 2025

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

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).
Eric Weisstein's World of Mathematics, Alternating Group.
Index entries for sequences that are permutations of the natural numbers.

Cf. A016813 (row lengths), A000384, A000027, A381662, A380817, A376214, A380200, A378684, A379342, A380245, A381664, A380815, A381663.

T[n_,k_]:=(2*(k+n-1)^2+2k-2n+3+(-2k-2n+3)*(-1)^n-(-1)^k+(-2k-2n+1)*(-1)^(k+n))/4;Table[T[k,n],{k,1,5},{n,1,5}]

Linear sequence: (a(1),a(2), ... a(A000384(n+1))) is a permutation of the positive integers from 1 to A000384(n+1). ord((a(1),a(2), ... a(A000384(n+1)))) = 3, where ord is the order of the permutation.
Triangular array T(n,k) for 1 <= k <= 4n - 3 (see Example): T(n,k) = A000384(n-1) + P(n,k), P(n,k) = k + 1, if k < m(n) and k mod 2 = 1, P(n,k) = k + m(n) - 1, if k < m(n) and k mod 2 = 0, P(n,k) = k, if k => m(n) and k mod 2 = 1, P(n,k) = k - m(n), if k => m(n) and k mod 2 = 0, where m(n) = 2n-1.
G.f.: x*y*(1 + x^8*y^4 + x*(2 + y) + x^7*y^3*(9 + 8*y)  - x^3*y*(8 + 8*y - 3*y^2) - x^2*(1 - 8*y - 9*y^2) + x^6*(y^2 - 4*y^3 - 5*y^4) + x^5*(3*y - 8*y^3 - 2*y^4) + 2*x^4*(1 - 2*y - 5*y^2 + y^4))/((1 - x)^3*(1 + x)^2*(1 - x*y)^3*(1 + x*y)^2). - Stefano Spezia, Dec 21 2024

A376214 a(n) = A379342(A379343(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Feb 05 2025

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. For n > 0, the length of row n is 4n-3 = A016813(n-1).
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, A380817, 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 27 2025
A381968 and A380817 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, A376217, A382680. For subgroups and the Cayley table of the group D4 see Boris Putievskiy (2025 D4 (I)) link. - Boris Putievskiy, Apr 27 2025
A378762, A381968 and A380817 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, A380817, A382679, A382680, A378762, A383419, A383589, A383590, A056023, A383722, A383723, 383724. For subgroups and the Cayley table of the group D4xC2 see Boris Putievskiy (2025 D4xC2) link. - Boris Putievskiy, May 27 2025

			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:  7, 10, 9, 8, 11, 14, 13, 12, 15;
(1, 2, 3, ..., 12, 15) = (1, 2, 3, ..., 12, 15)^(-1).
(1, 2, 3, ..., 12, 15) = (1, 5, 2, ..., 10, 15) (1, 3, 5, ..., 7, 15). The first permutation is from Example A380245 and the second from Example A378684.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  3,  6,  8, 15, ...
   2,  5,  9, 12, 20, ...
   4, 10, 13, 19, 26, ...
   7, 14, 18, 25, 33, ...
  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;
  1, 4, 3, 2, 5, 8, 7, 6, 9.

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 (2025 D4 (I)).
Boris Putievskiy, The Direct Product D4xC2: Subgroups and the Cayley Table (2025 D4xC2).
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.

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

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

a(n) = A380245(A378684(n)).

T(n,k) for 1 <= k <= 4n - 3: T(n,k) = A000384(n-1) + P(n,k), P(n,k) = k 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 and k == 1 (mod 2), P(n,k) = -k + 3m - 1 if k >= m and k == 0 (mod 2), where m = 2n - 1.

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

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

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Jan 17 2025

The 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 an intra-block permutation of the positive integers.
Generalization of 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, A381664 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A379343, A380200, A379342, A378684, A380815, A381663. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Mar 31 2025

			Triangle array begins:
  k=    1  2   3  4   5   6   7   8   9
  n=1:  1;
  n=2:  5, 2,  4, 3,  6;
  n=3: 14, 9, 12, 7, 11,  8, 13, 10, 15;
ord(1, 5, 2, ..., 10, 15) = 3.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  2,  6,  7, 15, ...
   5,  3, 12, 10, 23, ...
   4,  9, 13, 18, 26, ...
  14,  8, 25, 19, 40, ...
  11, 20, 24, 33, 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;
  4, 1, 3, 2, 5;
  8, 3, 6, 1, 5, 2, 7, 4, 9.

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).
Eric Weisstein's World of Mathematics, Alternating Group
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379342, A379343, A380200, A380815, A380817, A381662, A381663, A381664.

Mathematica
```
P[n_,k_]:=Module[{m=2*n-1},If[k
				
```

Linear sequence: (a(1), a(2), ..., a(A000384(n+1))) is a permutation of the positive integers from 1 to A000384(n+1). ord(a(1), a(2), ..., a(A000384(n+1))) = 3, where ord is the order of the permutation.

Triangular array T(n,k) for 1 <= k <= 4n - 3 (see Example): T(n,k) = A000384(n-1) + P(n,k), P(n,k) = -k + 2*m - 1 if k < m and k == 1 (mod 2), P(n,k) = m - k if k < m and k == 0 (mod 2), P(n,k) = k if k >= m and k == 1 (mod 2), P(n,k) = k - m + 1 if k >= m and k == 0 (mod 2), where m = 2*n - 1.

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

A380815 a(n) = A379343(A378684(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Feb 04 2025

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 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, A381663 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A379343, A380200, A378684, A379342, A380245, A381664. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Apr 09 2025

			Triangle array begins:
  k=    1  2   3  4   5   6   7  8   9
  n=1:  1;
  n=2:  5, 2,  4, 3,  6;
  n=3: 12, 9, 14, 7, 11, 10, 13, 8, 15;
ord(1, 5, 2, ..., 10, 15) = 3.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  2,  6,  7, 15, ...
   5,  3, 14,  8, 27, ...
   4,  9, 13, 18, 26, ...
  12, 10, 25, 19, 42, ...
  11, 20, 24, 33, 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;
  4, 1, 3, 2, 5;
  6, 3, 8, 1, 5, 4, 7, 2, 9.

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).
Eric Weisstein's World of Mathematics, Alternating Group
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379342, A379343, A380200, A380245, A380817, A381662, A381663, A381664.

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

(a(1), a(2), ..., a(A000384(n+1))) is permutation of the positive integers from 1 to A000384(n+1). ord(a(1), a(2), ..., a(A000384(n+1))) = 3, where ord is the order of the permutation.

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

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

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

Original entry on oeis.org

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

Boris Putievskiy, Feb 04 2025

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

			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.

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.

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.

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

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.

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

A381663 a(n) = A379342(A380200(n)).

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Mar 03 2025

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 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, A380815 (the inverse permutation), A000027 (the identity permutation), A381662, A380817, A376214, A379343, A380200, A378684, A379342, A380245, A381664. For subgroups and the Cayley table of the group A4 see Boris Putievskiy (2025) link. - Boris Putievskiy, Apr 10 2025

			Triangle array begins:
  k=    1   2  3   4   5  6   7  8   9
  n=1:  1;
  n=2:  3,  5, 4,  2,  6;
  n=3: 10, 14, 8, 12, 11, 7, 13, 9, 15;
ord(1, 3, 5, ..., 9, 15) = 3.
For n > 1, each row of triangle array joins two consecutive upward antidiagonals in the table:
   1,  5,  6, 12, 15, ...
   3,  2,  8,  9, 17, ...
   4, 14, 13, 25, 26, ...
  10,  7, 19, 18, 32, ...
  11, 27, 24, 42, 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;
  2, 4, 3, 1, 5;
  4, 8, 2, 6, 5, 1, 7, 3, 9.

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).
Eric Weisstein's World of Mathematics, Alternating Group.
Index entries for sequences that are permutations of the natural numbers.

Cf. A000027, A000384, A016813 (row lengths), A376214, A378684, A379342, A379343, A380200, A380245, A380815, A380817, A381662, A381664.

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

ord(a(1), a(2), ..., a(A000384(n+1))) = 3, where ord is the order of the permutation.

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

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

cp's OEIS Frontend

A381968 a(a(n)) = A381662(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A383589 a(n) = A378762(A381662(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A378684 a(n) = A378200(A378200(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A379342 a(n) = A378684(A378684(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A379343 Square array read by upward antidiagonals: T(n,k) = (2*(k+n-1)^2 + 2*k - 2*n + 3 + (-2*k - 2*n + 3)*(-1)^n - (-1)^k + (-2*k - 2*n + 1)*(-1)^(k+n))/4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A376214 a(n) = A379342(A379343(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A379343 Square array read by upward antidiagonals: T(n,k) = (2(k+n-1)^2 + 2k - 2n + 3 + (-2k - 2n + 3)(-1)^n - (-1)^k + (-2k - 2n + 1)*(-1)^(k+n))/4.