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.

A219732 a(n) = (Product_{i=1..n-1} (2^i + 1)) modulo (2^n - 1).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 9
7 1
8 0
9 74
10 33
11 1
12 1170
13 1
14 129
15 15101
16 0
17 1
18 187758
19 1
20 67650
21 615700
22 2049
23 1
24 4793490
25 3247204
26 8193
27 262658
28 4227330
29 1
30 480000312
31 1
32 0
33 2458463380
34 131073
35 10787055277
36 19903096980
37 1
38 524289
39 67117058
40 567489872400
41 1
42 2686322969514
43 1

List of values

[0, 0, 1, 0, 1, 9, 1, 0, 74, 33, 1, 1170, 1, 129, 15101, 0, 1, 187758, 1, 67650, 615700, 2049, 1, 4793490, 3247204, 8193, 262658, 4227330, 1, 480000312, 1, 0, 2458463380, 131073, 10787055277, 19903096980, 1, 524289, 67117058, 567489872400, 1, 2686322969514, 1]