login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064578 Inverse permutation to A057027. 5

%I #99 Apr 22 2024 20:16:30

%S 1,2,3,4,6,5,7,9,10,8,11,13,15,14,12,16,18,20,21,19,17,22,24,26,28,27,

%T 25,23,29,31,33,35,36,34,32,30,37,39,41,43,45,44,42,40,38,46,48,50,52,

%U 54,55,53,51,49,47,56,58,60,62,64,66,65,63,61,59,57,67,69,71,73,75,77

%N Inverse permutation to A057027.

%C The sequence is an intra-block permutation of positive integers. - _Boris Putievskiy_, Mar 13 2024

%H Boris Putievskiy, <a href="/A064578/b064578.txt">Table of n, a(n) for n = 1..9870</a>

%H Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations [Of] Integer Sequences And Pairing Functions</a>, arXiv preprint arXiv:1212.2732 [math.CO], 2012.

%H 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 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F From _Boris Putievskiy_, Mar 29 2024: (Start)

%F a(n) = A057944(n-1) + A194959(n).

%F T(n,k) = (n-1)*n/2 + min(2*k-1, 2*(n-k+1)), for 1 <= k <= n.

%F (End)

%e From _Boris Putievskiy_, Mar 13 2024: (Start)

%e Start of the sequence as a triangular array T(n,k) read by rows:

%e k=1 2 3 4 5 6

%e n=1: 1;

%e n=2: 2, 3;

%e n=3: 4, 6, 5;

%e n=4: 7, 9, 10, 8;

%e n=5: 11, 13, 15, 14, 12;

%e n=6: 16, 18, 20, 21, 19, 17;

%e Row n contains a permutation block of the n numbers (n-1)*n/2+1, (n-1)*n/2+2, ..., (n-1)*n/2+n to themselves.

%e Subtracting (n-1)*n/2 from each term in row n gives A194959, in which each row is a permutation of 1..n:

%e 1;

%e 1, 2;

%e 1, 3, 2;

%e 1, 3, 4, 2;

%e 1, 3, 5, 4, 2;

%e 1, 3, 5, 6, 4, 2; (End)

%t T[n_, k_] := (n - 1)*n/2 + Min[2*k - 1, 2*(n - k + 1)];

%t Nmax = 6; Table[T[n, k], {n, 1, Nmax}, {k, 1, n}] // Flatten (* _Boris Putievskiy_, Mar 29 2024 *)

%o (PARI) a(n) = my(A = (sqrtint(8*n) + 1)\2, B = A*(A - 1)/2, C = n - B); B + if(C <= (A+1)\2, 2*C - 1, 2*(A - C + 1)) \\ _Mikhail Kurkov_, Mar 12 2024

%Y Cf. A057027, A057944, A194959.

%K nonn,easy

%O 1,2

%A _N. J. A. Sloane_, Oct 16 2001

%E More terms from _Vladeta Jovovic_, Oct 18 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 04:07 EDT 2024. Contains 375085 sequences. (Running on oeis4.)