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.

A368339 Take the solution to Pellian equation x^2 - 8*n*y^2 = 1 with smallest positive y and x >= 0; sequence gives a(n) = y, or 0 if n is twice a positive square. A368340 gives values of x.

Table of values

n a(n)
1 1
2 0
3 1
4 3
5 3
6 1
7 2
8 0
9 2
10 1
11 21
12 5
13 5
14 12
15 1
16 51
17 3
18 0
19 3
20 57
21 1
22 15
23 1794
24 7
25 7
26 45
27 33
28 1
29 1287
30 2
31 4
32 0
33 4
34 2
35 15
36 1
37 215
38 3315
39 3
40 9
41 9
42 3
43 561
44 4137
45 1
46 60
47 110532
48 245
49 5
50 0
51 5
52 255
53 1557945
54 65
55 1
56 6
57 48
58 455
59 14127
60 11
61 11
62 207480
63 20
64 29427
65 285
66 1

List of values

[1, 0, 1, 3, 3, 1, 2, 0, 2, 1, 21, 5, 5, 12, 1, 51, 3, 0, 3, 57, 1, 15, 1794, 7, 7, 45, 33, 1, 1287, 2, 4, 0, 4, 2, 15, 1, 215, 3315, 3, 9, 9, 3, 561, 4137, 1, 60, 110532, 245, 5, 0, 5, 255, 1557945, 65, 1, 6, 48, 455, 14127, 11, 11, 207480, 20, 29427, 285, 1]