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.

A082393 Let p = n-th prime of the form 4k+1, take the integer solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with the smallest y >= 1; sequence gives value of y.

Table of values

n a(n)
1 4
2 180
3 8
4 1820
5 12
6 320
7 9100
8 226153980
9 267000
10 53000
11 6377352
12 20
13 15140424455100
14 113296
15 519712
16 2113761020
17 3726964292220
18 190060
19 183567298683461940
20 448036604040
21 28
22 386460
23 70255304
24 649641205044600

List of values

[4, 180, 8, 1820, 12, 320, 9100, 226153980, 267000, 53000, 6377352, 20, 15140424455100, 113296, 519712, 2113761020, 3726964292220, 190060, 183567298683461940, 448036604040, 28, 386460, 70255304, 649641205044600]