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.

A086378 Sum of successive remainders in computing Euclidean algorithm for (1,1/sqrt(n)) is rational.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 9
6 12
7 16
8 20
9 25
10 30
11 36
12 42
13 49
14 55
15 56
16 64
17 70
18 72
19 81
20 90
21 100
22 110
23 121
24 132
25 144
26 153
27 155
28 156
29 169
30 180
31 182
32 196
33 210
34 225
35 240
36 256
37 272
38 289
39 305
40 306
41 324
42 342
43 361
44 377
45 380
46 400
47 420
48 441
49 462
50 484
51 504
52 505
53 506
54 529
55 546
56 552
57 576
58 600

List of values

[1, 2, 4, 6, 9, 12, 16, 20, 25, 30, 36, 42, 49, 55, 56, 64, 70, 72, 81, 90, 100, 110, 121, 132, 144, 153, 155, 156, 169, 180, 182, 196, 210, 225, 240, 256, 272, 289, 305, 306, 324, 342, 361, 377, 380, 400, 420, 441, 462, 484, 504, 505, 506, 529, 546, 552, 576, 600]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.