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.

A000773 Number of numbers == 0 (mod 3) in range 2^n to 2^(n+1) with odd number of 1's in binary expansion.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 6
7 8
8 29
9 45
10 130
11 220
12 561
13 1001
14 2366
15 4368
16 9829
17 18565
18 40410
19 77540
20 164921
21 320001
22 669526
23 1309528
24 2707629
25 5326685
26 10919090
27 21572460
28 43942081
29 87087001
30 176565486
31 350739488
32 708653429
33 1410132405
34 2841788170
35 5662052980

List of values

[0, 0, 0, 1, 1, 6, 8, 29, 45, 130, 220, 561, 1001, 2366, 4368, 9829, 18565, 40410, 77540, 164921, 320001, 669526, 1309528, 2707629, 5326685, 10919090, 21572460, 43942081, 87087001, 176565486, 350739488, 708653429, 1410132405, 2841788170, 5662052980]