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
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.
Cf.
A000027,
A000384,
A016813 (row lengths),
A376214,
A379342,
A379343,
A380200,
A380245,
A380815,
A380817,
A381662,
A381663,
A381664.
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
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.
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}]]
Original entry on oeis.org
1, 2, 3, 6, 5, 4, 9, 10, 7, 8, 15, 14, 13, 12, 11, 20, 21, 18, 19, 16, 17, 28, 27, 26, 25, 24, 23, 22, 35, 36, 33, 34, 31, 32, 29, 30, 45, 44, 43, 42, 41, 40, 39, 38, 37, 54, 55, 52, 53, 50, 51, 48, 49, 46, 47, 66, 65, 64, 63, 62, 61, 60, 59, 58, 57, 56
Offset: 1
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: 9, 10, 7, 8, 15, 14, 13, 12, 11;
(1, 2, 3, ..., 12, 11) = (A378200(1), A378200(2), A378200(3), ..., A378200(14), A378200(15))^3.
(1, 2, 3, ..., 12, 11) = (1, 2, 3, ..., 12, 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, 7, 12, 16, ...
6, 10, 13, 19, 24, ...
9, 14, 18, 25, 31, ...
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;
3, 4, 1, 2, 9, 8, 7, 6, 5.
Cf.
A000027,
A000384,
A016813 (row lengths),
A056023,
A376214,
A378684,
A379342,
A379343,
A380200,
A380245,
A380815,
A380817,
A381662,
A381663,
A381664,
A381968,
A382499,
A382679,
A382680,
A383419,
A383589,
A383590,
A383722,
A383723,
A383724.
A378200
Square array read by upward antidiagonals: T(n,k) = ((k + n - 1)^2 + (k - n + 1)*(-1)^n + (1 - k - n)*(-1)^k + (1 - k - n)*(-1)^(k + n) + 2)/2.
Original entry on oeis.org
1, 5, 2, 6, 3, 4, 12, 9, 14, 7, 15, 8, 13, 10, 11, 23, 20, 25, 18, 27, 16, 28, 17, 26, 19, 24, 21, 22, 38, 35, 40, 33, 42, 31, 44, 29, 45, 30, 43, 32, 41, 34, 39, 36, 37, 57, 54, 59, 52, 61, 50, 63, 48, 65, 46, 66, 47, 64, 49, 62, 51, 60, 53, 58, 55, 56
Offset: 1
Table begins:
1, 2, 4, 7, 11, ...
5, 3, 14, 10, 27, ...
6, 9, 13, 18, 24, ...
12, 8, 25, 19, 42, ...
15, 20, 26, 33, 41, ...
...
The first 5 antidiagonals are:
1;
5, 2;
6, 3, 4;
12, 9, 14, 7;
15, 8, 13, 10, 11;
Triangle array begins:
k= 1 2 3 4 5 6 7 8 9
n=1: 1;
n=2: 5, 2, 6, 3, 4;
n=3: 12, 9, 14, 7, 15, 8, 13, 10, 11;
Subtracting (n-1)*(2*n-3) from each term is row n produces a permutation of numbers from 1 to 4*n-3:
1;
4, 1, 5, 2, 3;
6, 3, 8, 1, 9, 2, 7, 4, 5.
Cf.
A000027,
A000384,
A016813 (row lengths),
A370655,
A373498,
A374447,
A374494,
A374531,
A375602,
A375725,
A376214,
A378684,
A378705,
A378762,
A379342,
A379343,
A380245,
A380815,
A380817,
A381662,
A381663,
A381664..
-
T[n_, k_] := ((k + n - 1)^2 + (k - n + 1)*(-1)^n + (1 - k - n)*(-1)^k + (1 - k - n)*(-1)^(k + n) + 2)/2;
Table[T[k, n], {k, 1, 5}, {n, 1, 5}]
Showing 1-4 of 4 results.
Comments