cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 4
5 2
6 4
7 1
8 8
9 4
10 8
11 2
12 8
13 4
14 8
15 1
16 16
17 8
18 16
19 4
20 16
21 8
22 16
23 2
24 16
25 8
26 16
27 4
28 16
29 8
30 16
31 1
32 32
33 16
34 32
35 8
36 32
37 16
38 32
39 4
40 32
41 16
42 32
43 8
44 32
45 16
46 32
47 2
48 32
49 16
50 32
51 8
52 32
53 16
54 32
55 4
56 32
57 16
58 32
59 8
60 32
61 16
62 32
63 1
64 64
65 32
66 64
67 16
68 64
69 32
70 64
71 8
72 64
73 32
74 64
75 16
76 64
77 32
78 64
79 4
80 64
81 32

List of values

[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]