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.

A186814 a(n) = smallest number m such that A002144(n) divides gcd(A002314(n)^2+1,(A002314(n)+m)^2+1).

Table of values

n a(n)
1 1
2 3
3 9
4 5
5 25
6 23
7 7
8 39
9 19
10 21
11 53
12 81
13 43
14 83
15 63
16 61
17 101
18 13
19 143
20 31
21 169
22 15
23 55
24 113
25 225
26 105
27 157
28 175
29 17
30 263
31 89
32 41
33 77
34 269
35 165
36 159
37 271
38 361
39 123
40 363
41 75
42 315
43 239
44 365
45 93
46 51
47 437
48 321
49 397
50 529
51 439
52 351
53 543
54 229
55 333
56 355
57 449
58 557
59 625
60 431
61 517
62 27
63 583

List of values

[1, 3, 9, 5, 25, 23, 7, 39, 19, 21, 53, 81, 43, 83, 63, 61, 101, 13, 143, 31, 169, 15, 55, 113, 225, 105, 157, 175, 17, 263, 89, 41, 77, 269, 165, 159, 271, 361, 123, 363, 75, 315, 239, 365, 93, 51, 437, 321, 397, 529, 439, 351, 543, 229, 333, 355, 449, 557, 625, 431, 517, 27, 583]

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

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