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.

A218154 a(n) is the smallest positive integer k such that k^8 + 1 == 0 mod p, where p is the n-th prime of the form 1 + 16*b (see A094407).

Table of values

n a(n)
1 3
2 8
3 35
4 3
5 44
6 2
7 30
8 36
9 30
10 151
11 35
12 27
13 82
14 16
15 8
16 27
17 68
18 40
19 52
20 62
21 67
22 104
23 287
24 98
25 157
26 63
27 100
28 143
29 99
30 257
31 36
32 189
33 151
34 458
35 108
36 155
37 348
38 105
39 227
40 598
41 67
42 25
43 460
44 169
45 250
46 342
47 24
48 423
49 286
50 221
51 627
52 113
53 107
54 206
55 279
56 506
57 630
58 57
59 39

List of values

[3, 8, 35, 3, 44, 2, 30, 36, 30, 151, 35, 27, 82, 16, 8, 27, 68, 40, 52, 62, 67, 104, 287, 98, 157, 63, 100, 143, 99, 257, 36, 189, 151, 458, 108, 155, 348, 105, 227, 598, 67, 25, 460, 169, 250, 342, 24, 423, 286, 221, 627, 113, 107, 206, 279, 506, 630, 57, 39]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.