|
Search: id:A082908
|
|
|
| A082908 |
|
Largest value of GCD[2^n,C[n,j]] if j=0,..,n-1; providing maximal value of largest power of 2 dividing C[n,j] in the n-th row of Pascal triangle. |
|
+0
2
|
|
| 1, 1, 2, 1, 4, 2, 4, 1, 8, 4, 8, 2, 8, 4, 8, 1, 16, 8, 16, 4, 16, 8, 16, 2, 16, 8, 16, 4, 16, 8, 16, 1, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16, 32, 8, 32, 16, 32, 2, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16, 32, 8, 32, 16, 32, 1, 64, 32, 64, 16, 64, 32, 64, 8, 64, 32, 64, 16, 64, 32, 64, 4, 64, 32
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n)=Max{GCD[2^n, C[n, j]], j=0, .., n}
|
|
EXAMPLE
|
n=10:10th row={1,10,45,120,210,252,210,120,45,10,1},
largest powers of 2 dividing entries: {1,2,1,8,2,4,2,8,1,2,1};
maximal 2^k-divisor is a(10)=8.
|
|
MATHEMATICA
|
Table[Max[Table[GCD[2^n, Binomial[n, j]], {j, 0, n}]], {n, 0, 128}]
|
|
CROSSREFS
|
Cf. A000005, A007318, A000079, A082907.
Sequence in context: A121464 A090278 A153279 this_sequence A086449 A070556 A065295
Adjacent sequences: A082905 A082906 A082907 this_sequence A082909 A082910 A082911
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 23 2003
|
|
|
Search completed in 0.003 seconds
|
