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).
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).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =6a(4) =9a(5) =12a(6) =16a(7) =20a(8) =25a(9) =30a(10) =36a(11) =42a(12) =49a(13) =55a(14) =56a(15) =64a(16) =70a(17) =72a(18) =81a(19) =90a(20) =100a(21) =110a(22) =121a(23) =132a(24) =144a(25) =155a(26) =156a(27) =169a(28) =180a(29) =182
External references
- oeis: A088900