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.

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

Table of values

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

List of values

[1, 1, 2, 2, 3, 2, 3, 4, 6, 3, 6, 2, 7, 3, 6, 8, 4, 6, 10, 6, 6, 6, 11, 4, 15, 7, 18, 6, 5, 6, 15, 16, 6, 4, 3, 6, 19, 10, 14, 12, 5, 6, 22, 6, 6, 11, 23, 8, 21, 15, 4, 14, 27, 18, 6, 12, 10, 5, 10, 6, 31, 15, 6, 32, 21, 6, 34, 4, 22, 3, 35, 12, 18, 19, 30]