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

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

Terms

    a(0) =1a(1) =2a(2) =4a(3) =9a(4) =12a(5) =16a(6) =25a(7) =30a(8) =36a(9) =49a(10) =55a(11) =56a(12) =64a(13) =70a(14) =81a(15) =90a(16) =100a(17) =121a(18) =132a(19) =144a(20) =169a(21) =180a(22) =182a(23) =196a(24) =225a(25) =240a(26) =256a(27) =289a(28) =305a(29) =306

External references