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.

A112884 Number of bits required to represent binomial(2^n, 2^(n-1)).

Table of values

n a(n)
0 1
1 2
2 3
3 7
4 14
5 30
6 61
7 125
8 252
9 508
10 1019
11 2043
12 4090
13 8186
14 16377
15 32761
16 65528
17 131064
18 262135
19 524279
20 1048566
21 2097142
22 4194293
23 8388597
24 16777204
25 33554420
26 67108851
27 134217715
28 268435442
29 536870898
30 1073741809
31 2147483633
32 4294967280
33 8589934576
34 17179869167

List of values

[1, 2, 3, 7, 14, 30, 61, 125, 252, 508, 1019, 2043, 4090, 8186, 16377, 32761, 65528, 131064, 262135, 524279, 1048566, 2097142, 4194293, 8388597, 16777204, 33554420, 67108851, 134217715, 268435442, 536870898, 1073741809, 2147483633, 4294967280, 8589934576, 17179869167]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.