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.

A298211 Smallest n such that A001353(a(n)) == 0 (mod n), i.e., x=A001075(a(n)) and y=A001353(a(n)) is the fundamental solution of the Pell equation x^2 - 3*(n*y)^2 = 1.

Table of values

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

List of values

[1, 2, 3, 2, 3, 6, 4, 4, 9, 6, 5, 6, 6, 4, 3, 8, 9, 18, 5, 6, 12, 10, 11, 12, 15, 6, 27, 4, 15, 6, 16, 16, 15, 18, 12, 18, 18, 10, 6, 12, 7, 12, 11, 10, 9, 22, 23, 24, 28, 30, 9, 6, 9, 54, 15, 4, 15, 30, 29, 6, 30, 16, 36, 32, 6, 30, 17, 18, 33, 12, 7, 36, 18, 18, 15]