A088900 - cp's OEIS frontend

A088900 Numbers n such that 2nk(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).

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	155
27	156
28	169
29	180
30	182
31	196
32	210
33	225
34	240
35	256
36	272
37	289
38	305
39	306
40	324
41	342
42	361
43	377
44	380
45	400
46	420
47	441
48	462
49	484
50	504
51	505
52	506
53	529
54	546
55	552
56	576
57	600
58	625

[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, 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, 625]

cp's OEIS Frontend

A088900 Numbers n such that 2nk(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

List 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	155
27	156
28	169
29	180
30	182
31	196
32	210
33	225
34	240
35	256
36	272
37	289
38	305
39	306
40	324
41	342
42	361
43	377
44	380
45	400
46	420
47	441
48	462
49	484
50	504
51	505
52	506
53	529
54	546
55	552
56	576
57	600
58	625

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	155
27	156
28	169
29	180
30	182
31	196
32	210
33	225
34	240
35	256
36	272
37	289
38	305
39	306
40	324
41	342
42	361
43	377
44	380
45	400
46	420
47	441
48	462
49	484
50	504
51	505
52	506
53	529
54	546
55	552
56	576
57	600
58	625

cp's OEIS Frontend

A088900 Numbers n such that 2*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

List of values

A088900 Numbers n such that 2nk(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).

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	155
27	156
28	169
29	180
30	182
31	196
32	210
33	225
34	240
35	256
36	272
37	289
38	305
39	306
40	324
41	342
42	361
43	377
44	380
45	400
46	420
47	441
48	462
49	484
50	504
51	505
52	506
53	529
54	546
55	552
56	576
57	600
58	625