A380815 a(n) = A379343(A378684(n)).
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
Examples
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.
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).
- Eric Weisstein's World of Mathematics, Alternating Group
- Index entries for sequences that are permutations of the natural numbers.
Crossrefs
Programs
-
Mathematica
T[n_,k_]:=(n-1)*(2*n-3)+Module[{m=2*n-1},If[k
Formula
(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.
Extensions
Name corrected by Pontus von Brömssen, Jun 24 2025
Comments