A071677 Numbers k such that the number of divisors of k equals the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k.

1, 3, 8, 9, 14, 15, 22, 44, 45, 52, 63, 64, 105, 110, 130, 152, 154, 165, 174, 184, 189, 190, 195, 196, 208, 225, 230, 232, 256, 272, 310, 405, 442, 464, 496, 512, 567, 592, 656, 688, 820, 884, 891, 940, 976, 1036, 1068, 1125, 1148, 1210, 1215, 1284, 1305

Offset

1,2

Links

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

Prog

(PARI) for(n=1, 1000, if( numdiv(n) == vecmax( vector(n, i, length(contfrac(n/i)))), print1(n, ", ")));

Crossrefs

Sequence in context: A082721 A239388 A259850 * A084747 A286177 A287579

Adjacent sequences: A071674 A071675 A071676 * A071678 A071679 A071680

Keyword

easy,nonn

Author

Benoit Cloitre, Jun 22 2002

Status

approved