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.

A088901 Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there).

Table of values

n a(n)
1 1
2 2
3 4
4 9
5 12
6 16
7 25
8 30
9 36
10 49
11 55
12 56
13 64
14 70
15 81
16 90
17 100
18 121
19 132
20 144
21 169
22 180
23 182
24 196
25 225
26 240
27 256
28 289
29 305
30 306
31 324
32 361
33 377
34 380
35 400
36 441
37 462
38 484
39 529
40 552
41 576
42 625
43 646
44 650
45 676
46 729
47 755
48 756
49 784
50 841
51 870
52 900
53 961
54 987
55 990
56 992

List of values

[1, 2, 4, 9, 12, 16, 25, 30, 36, 49, 55, 56, 64, 70, 81, 90, 100, 121, 132, 144, 169, 180, 182, 196, 225, 240, 256, 289, 305, 306, 324, 361, 377, 380, 400, 441, 462, 484, 529, 552, 576, 625, 646, 650, 676, 729, 755, 756, 784, 841, 870, 900, 961, 987, 990, 992]

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

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