|
%I #25 Feb 15 2022 12:53:49
%S 1,3,5,2,6,9,13,8,4,10,14,19,25,18,12,7,15,20,26,33,41,32,24,17,11,21,
%T 27,34,42,51,61,50,40,31,23,16,28,35,43,52,62,73,85,72,60,49,39,30,22,
%U 36,44,53,63,74,86,99,113,98,84,71,59,48,38,29,45,54,64,75,87,100,114
%N Inverse permutation to A060734.
%C From _Boris Putievskiy_, Mar 14 2013: (Start)
%C a(n) is a pairing function: a function that reversibly maps Z^{+} x Z^{+} onto Z^{+}, where Z^{+} is the set of integer positive numbers.
%C Layer is pair of sides of square from T(1,n) to T(n,n) and from T(n,n) to T(n,1). This sequence is A188568 as table read by boustrophedonic ("ox-plowing") method - layer clockwise, layer counterclockwise and so. The same table A188568 read layer by layer clockwise is A194280. (End)
%H Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a>, arXiv:1212.2732 [math.CO], 2012.
%H Eric Weisstein's MathWorld, <a href="http://mathworld.wolfram.com/PairingFunction.html">Pairing Function</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(n) = (i+j-1)*(i+j-2)/2+i, where i=min(t; t^2-n+1), j=min(t; n-(t-1)^2), t=floor(sqrt(n-1))+1. - _Boris Putievskiy_, Dec 24 2012
%e From _Boris Putievskiy_, Mar 14 2013: (Start)
%e The start of the sequence as table:
%e 1....2...6...7..15..16..28...
%e 3....5...9..12..20..23..35...
%e 4....8..13..18..26..31..43...
%e 10..14..19..25..33..40..52...
%e 11..17..24..32..41..50..62...
%e 21..27..34..42..51..61..73...
%e 22..30..39..49..60..72..85...
%e ...
%e The start of the sequence as triangular array read by rows:
%e 1;
%e 3,5,2;
%e 6,9,13,8,4;
%e 10,14,19,25,18,12,7;
%e 15,20,26,33,41,32,24,17,11;
%e 21,27,34,42,51,61,50,40,31,23,16;
%e 28,35,43,52,62,73,85,72,60,49,39,30,22;
%e ...
%e Row number r contains 2*r-1 numbers. (End)
%Y Cf. A060734, A064788, A188568, A194280.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, Oct 20 2001
|
