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.

A218164 a(n) is the smallest positive integer k such that k^64 + 1 == 0 mod p, where p is the n-th prime of the form 1 + 128*b (see A208177).

Table of values

n a(n)
1 9
2 21
3 5
4 38
5 21
6 31
7 33
8 63
9 42
10 66
11 118
12 131
13 202
14 29
15 28
16 31
17 58
18 171
19 94
20 182
21 309
22 182
23 81
24 272
25 110
26 175
27 657
28 491
29 42
30 100
31 523
32 244
33 168
34 199
35 145
36 138
37 79
38 73
39 357
40 826
41 210
42 541
43 523
44 215
45 98
46 220
47 1478
48 22
49 92
50 178
51 50
52 709
53 250
54 2523
55 630
56 218
57 7

List of values

[9, 21, 5, 38, 21, 31, 33, 63, 42, 66, 118, 131, 202, 29, 28, 31, 58, 171, 94, 182, 309, 182, 81, 272, 110, 175, 657, 491, 42, 100, 523, 244, 168, 199, 145, 138, 79, 73, 357, 826, 210, 541, 523, 215, 98, 220, 1478, 22, 92, 178, 50, 709, 250, 2523, 630, 218, 7]