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.

A298669 Let b(n) = 2^n with n >= 2, and let c = k*b(n) + 1 for k >= 1; then a(n) is the smallest k such that c is prime and such that A007814(r(n)) = A007814(k) + n where r(n) is the remainder of 2^(b(n)/4) mod c, or 0 if no such k exists.

Table of values

n a(n)
2 0
3 0
4 1
5 8
6 1024
7 5
8 1071
9 6443
10 52743
11 1184
12 11131
13 39
14 7
15 856079
16 3363658
17 9264
18 3150
19 1313151
20 13
21 33629
22 555296667
23 534689
24 8388607
25 5
26 512212693
27 193652
28 286330
29 282030
30 7224372579
31 1120049
32 149041

List of values

[0, 0, 1, 8, 1024, 5, 1071, 6443, 52743, 1184, 11131, 39, 7, 856079, 3363658, 9264, 3150, 1313151, 13, 33629, 555296667, 534689, 8388607, 5, 512212693, 193652, 286330, 282030, 7224372579, 1120049, 149041]