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.

A295196 Numbers n > 1 such that 2^(n-1) and (2*n-m)*2^(((n-1)/2) - floor(log_2(n))) are congruent to 1 (mod n) for at least one of m = 3, m = 7 and m = 15.

Table of values

n a(n)
1 7
2 23
3 31
4 47
5 71
6 79
7 263
8 271
9 1031
10 1039
11 2063
12 4111
13 32783
14 65543
15 65551
16 262151
17 1048583
18 4194319
19 8388623
20 67108879
21 268435463
22 1073741831
23 1073741839
24 4294967311

List of values

[7, 23, 31, 47, 71, 79, 263, 271, 1031, 1039, 2063, 4111, 32783, 65543, 65551, 262151, 1048583, 4194319, 8388623, 67108879, 268435463, 1073741831, 1073741839, 4294967311]