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.

A071296 a(n) is the least m such that a period of the continued fraction expansion of sqrt(m) is 1,1,1,...,1,1,1,Z and there are n ones in the period (Z is 2*floor(sqrt(m))). If no such m exists, a(n) = 0.

Table of values

n a(n)
1 3
2 0
3 7
4 13
5 0
6 58
7 135
8 0
9 819
10 2081
11 0
12 13834
13 35955
14 0
15 244647
16 639389
17 0
18 4374866
19 11448871
20 0
21 78439683
22 205337953
23 0
24 1407271538
25 3684200835
26 0
27 25251313255
28 66108441037
29 0
30 453111560266
31 1186259960295
32 0
33 8130736409715
34 21286537898177
35 0

List of values

[3, 0, 7, 13, 0, 58, 135, 0, 819, 2081, 0, 13834, 35955, 0, 244647, 639389, 0, 4374866, 11448871, 0, 78439683, 205337953, 0, 1407271538, 3684200835, 0, 25251313255, 66108441037, 0, 453111560266, 1186259960295, 0, 8130736409715, 21286537898177, 0]