Largest value of gcd(2^n, binomial(n,j)) with j=0..n-1; maximum value of largest power of 2 dividing binomial(n,j) in the n-th row of Pascal's triangle.
A082908
Largest value of gcd(2^n, binomial(n,j)) with j=0..n-1; maximum value of largest power of 2 dividing binomial(n,j) in the n-th row of Pascal's triangle.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =2a(6) =4a(7) =1a(8) =8a(9) =4a(10) =8a(11) =2a(12) =8a(13) =4a(14) =8a(15) =1a(16) =16a(17) =8a(18) =16a(19) =4a(20) =16a(21) =8a(22) =16a(23) =2a(24) =16a(25) =8a(26) =16a(27) =4a(28) =16a(29) =8
External references
- oeis: A082908