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.

A298212 Smallest n such that A060645(a(n)) = 0 (mod n), i.e., x=A023039(a(n)) and y=A060645(a(n)) is the fundamental solution of the Pell equation x^2 - 5*(n*y)^2 = 1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 5
6 2
7 4
8 2
9 2
10 5
11 5
12 2
13 7
14 4
15 10
16 4
17 3
18 2
19 3
20 5
21 4
22 5
23 4
24 2
25 25
26 7
27 6
28 4
29 7
30 10
31 5
32 8
33 10
34 3
35 20
36 2
37 19
38 3
39 14
40 10
41 10
42 4
43 22
44 5
45 10
46 4
47 8
48 4
49 28
50 25
51 6
52 7
53 9
54 6
55 5
56 4
57 6
58 7
59 29
60 10
61 5
62 5
63 4
64 16
65 35
66 10
67 34
68 3
69 4
70 20
71 35
72 2
73 37
74 19
75 50

List of values

[1, 1, 2, 1, 5, 2, 4, 2, 2, 5, 5, 2, 7, 4, 10, 4, 3, 2, 3, 5, 4, 5, 4, 2, 25, 7, 6, 4, 7, 10, 5, 8, 10, 3, 20, 2, 19, 3, 14, 10, 10, 4, 22, 5, 10, 4, 8, 4, 28, 25, 6, 7, 9, 6, 5, 4, 6, 7, 29, 10, 5, 5, 4, 16, 35, 10, 34, 3, 4, 20, 35, 2, 37, 19, 50]