A049824 a(n) = number of 3's in n-th row of array T given by A049816.

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 1, 2, 1, 2, 4, 2, 4, 3, 0, 4, 8, 5, 3, 5, 6, 5, 7, 3, 6, 9, 7, 8, 9, 6, 8, 12, 9, 8, 9, 7, 12, 11, 5, 12, 18, 12, 10, 9, 11, 12, 17, 16, 12, 14, 10, 18, 22, 12, 11, 16, 11, 16

Offset

1,11

Links

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

Example

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

Crossrefs

Cf. A049816.

Sequence in context: A116491 A131325 A193749 * A133087 A153919 A185286

Adjacent sequences: A049821 A049822 A049823 * A049825 A049826 A049827

Keyword

nonn

Author

Clark Kimberling

Status

approved