login
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).
2
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
OFFSET
1,2
COMMENTS
Subset of A086378.
CROSSREFS
Cf. A086378.
Sequence in context: A194164 A194254 A086378 * A371972 A083392 A076921
KEYWORD
nonn
AUTHOR
Thomas Baruchel, Oct 21 2003
STATUS
approved