This site is supported by donations to The OEIS Foundation.



"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049773 Triangular array T read by rows: if row n is r(1),...,r(m), then row n+1 is 2r(1)-1,...,2r(m)-1,2r(1),...,2r(m). 10


%S 1,1,2,1,3,2,4,1,5,3,7,2,6,4,8,1,9,5,13,3,11,7,15,2,10,6,14,4,12,8,16,

%T 1,17,9,25,5,21,13,29,3,19,11,27,7,23,15,31,2,18,10,26,6,22,14,30,4,

%U 20,12,28,8,24,16,32,1,33,17,49,9,41,25,57,5,37,21,53,13,45,29,61,3,35,19

%N Triangular array T read by rows: if row n is r(1),...,r(m), then row n+1 is 2r(1)-1,...,2r(m)-1,2r(1),...,2r(m).

%C n-th row = (r(1),r(2),...,r(m)), where m=2^(n-1), satisfies r(r(k))=k for k=1,2,...,m and has exactly 2^[ n/2 ] solutions of r(k)=k. (The function r(k) reverses bits. Or rather, r(k)=revbits(k-1)+1.

%C In a knockout competition with m players, arranging the competition brackets (see links) in r(k) order, where k is the rank of the player, ensures that highest ranked players cannot meet until the later stages of the competition. None of the top 2^p ranked players can meet earlier than the p-th from last round of the competition. At the same time the top ranked players in each match meet the highest ranked player possible consistent with this rule. The sequence for the top ranked players meeting the lowest ranked player possible is A208569. See also A131271. - _Colin Hall_, Jul 31 2011, Feb 29 2012

%H Alois P. Heinz, <a href="/A049773/b049773.txt">Rows n = 1..13, flattened</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Bracket_%28tournament%29">Bracket (tournament)</a>

%e Rows: {1}; {1,2}; {1,3,2,4}; {1,5,3,7,2,6,4,8}; ...

%p T:= proc(n) option remember; `if`(n=1, 1,

%p [map(x->2*x-1, [T(n-1)])[], map(x->2*x, [T(n-1)])[]][])

%p end:

%p seq(T(n), n=1..7); # _Alois P. Heinz_, Oct 28 2011

%t row[1] = {1}; row[n_] := row[n] = Join[ 2*row[n-1] - 1, 2*row[n-1] ]; Flatten[ Table[ row[n], {n, 1, 7}]] (* _Jean-Fran├žois Alcover_, May 03 2012 *)

%o (PARI) (a(n, k) = if( k<=0 || k>=n, 0, if( k%2, n\2) + a(n\2, k\2))); {T(n, k) = if( k<=0 || k>2^n/2, 0, 1 + a(2^n/2, k-1))}; /* _Michael Somos_, Oct 13 1999 */

%o (Haskell)

%o a049773 n k = a049773_tabf !! (n-1) !! (k-1)

%o a049773_row n = a049773_tabf !! (n-1)

%o a049773_tabf = iterate f [1] where

%o f vs = (map (subtract 1) ws) ++ ws where ws = map (* 2) vs

%o -- _Reinhard Zumkeller_, Mar 14 2015

%Y Sum of odd-indexed terms of n-th row gives A007582. Sum of even-indexed terms gives A049775.

%Y A030109 is another version.

%Y A131271.

%Y Cf. A088370. - _Alois P. Heinz_, Oct 28 2011

%Y Cf. A208569. - _Colin Hall_, Feb 29 2012

%Y Cf. A088208.

%K nonn,tabf,nice,look

%O 1,3

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy .

Last modified August 19 13:00 EDT 2017. Contains 290807 sequences.