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.

A047713 Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.

Table of values

n a(n)
1 561
2 1105
3 1729
4 1905
5 2047
6 2465
7 3277
8 4033
9 4681
10 6601
11 8321
12 8481
13 10585
14 12801
15 15841
16 16705
17 18705
18 25761
19 29341
20 30121
21 33153
22 34945
23 41041
24 42799
25 46657
26 49141
27 52633
28 62745
29 65281
30 74665
31 75361
32 80581
33 85489
34 87249
35 88357
36 90751
37 104653

List of values

[561, 1105, 1729, 1905, 2047, 2465, 3277, 4033, 4681, 6601, 8321, 8481, 10585, 12801, 15841, 16705, 18705, 25761, 29341, 30121, 33153, 34945, 41041, 42799, 46657, 49141, 52633, 62745, 65281, 74665, 75361, 80581, 85489, 87249, 88357, 90751, 104653]