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.

A334125 Number of subsets of {1, 3, ..., 2*n-1} which sum to 0 modulo 2*n-1.

Table of values

n a(n)
1 2
2 2
3 2
4 2
5 4
6 6
7 10
8 18
9 30
10 54
11 98
12 178
13 328
14 608
15 1130
16 2114
17 3974
18 7490
19 14170
20 26890
21 51150
22 97542
23 186420
24 356962
25 684784
26 1315870
27 2532410
28 4880646
29 9418806
30 18199014
31 35204650
32 68174116
33 132152842
34 256415958
35 497967282
36 967879954
37 1882725390
38 3665038872

List of values

[2, 2, 2, 2, 4, 6, 10, 18, 30, 54, 98, 178, 328, 608, 1130, 2114, 3974, 7490, 14170, 26890, 51150, 97542, 186420, 356962, 684784, 1315870, 2532410, 4880646, 9418806, 18199014, 35204650, 68174116, 132152842, 256415958, 497967282, 967879954, 1882725390, 3665038872]