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.

A001316 Gould's sequence: a(n) = Sum_{k=0..n} (binomial(n,k) mod 2); number of odd entries in row n of Pascal's triangle (A007318); a(n) = 2^A000120(n).

Table of values

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

List of values

[1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 4, 8, 8, 16, 8, 16, 16, 32, 8, 16, 16, 32, 16, 32, 32, 64, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 4, 8, 8, 16, 8, 16, 16, 32]