login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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).
0

%I #9 Oct 11 2017 05:08:18

%S 1,2,4,9,12,16,25,30,36,49,55,56,64,70,81,90,100,121,132,144,169,180,

%T 182,196,225,240,256,289,305,306,324,361,377,380,400,441,462,484,529,

%U 552,576,625,646,650,676,729,755,756,784,841,870,900,961,987,990,992

%N 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).

%C Subset of A086378 and A088900.

%Y Cf. A086378 and A088900.

%K nonn

%O 1,2

%A _Thomas Baruchel_, Oct 21 2003