1,7

Table of n, a(n) for n=1..70.

There are 4 numbers k from 1 to 11 for which the Euclidean algorithm on (11,k) has exactly 2 nonzero remainders; hence a(11)=4.

Sequence in context: A062790 A046640 A240388 * A143775 A244329 A003165

Adjacent sequences: A049820 A049821 A049822 * A049824 A049825 A049826

nonn

Clark Kimberling

approved