|
| |
|
|
A071677
|
|
Numbers n such that the number of divisors of n equals the maximum number of elements among the continued fractions for n/1, n/2, n/3, n/4 ...., n/n.
|
|
1
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| n such that A000005(n) = Max { 1<=i<=n: Card[ contfrac(n/i) ] }
|
|
|
PROG
| (PARI) for(n=1, 1000, if(numdiv(n)==vecmax(vector(n, i, length(contfrac(n/i)))), print1(n, ", ")))
|
|
|
CROSSREFS
| Sequence in context: A165289 A066494 A082721 * A084747 A101065 A152411
Adjacent sequences: A071674 A071675 A071676 * A071678 A071679 A071680
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002
|
| |
|
|
