%I A088900
%S A088900 1,2,4,6,9,12,16,20,25,30,36,42,49,55,56,64,70,72,81,90,100,110,121,132,
%T A088900 144,155,156,169,180,182,196,210,225,240,256,272,289,305,306,324,342,
%U A088900 361,377,380,400,420,441,462,484,504,505,506,529,546,552,576,600,625
%N 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).
%C A088900 Subset of A086378.
%Y A088900 Cf. A086378.
%Y A088900 Sequence in context: A168048 A075354 A086378 this_sequence A083392 A076921 
               A002620
%Y A088900 Adjacent sequences: A088897 A088898 A088899 this_sequence A088901 A088902 
               A088903
%K A088900 nonn
%O A088900 1,2
%A A088900 Thomas Baruchel (baruchel(AT)users.sourceforge.net), Oct 21 2003