|
Search: id:A053624
|
|
|
| A053624 |
|
Highly composite odd numbers (1): where d(n) increases to a record. |
|
+0
6
|
|
| 1, 3, 9, 15, 45, 105, 225, 315, 945, 1575, 2835, 3465, 10395, 17325, 31185, 45045, 121275, 135135, 225225, 405405, 675675, 1576575, 2027025, 2297295, 3828825, 6891885, 11486475, 26801775, 34459425, 43648605, 72747675, 130945815
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Also least number k such that the number of partitions of k into consecutive integers is a record. For example, 45 = 22+23 = 14+15+16 = 7+8+9+10+11 = 5+6+7+8+9+10 = 1+2+3+4+5+6+7+8+9, six such partitions, but all smaller terms have fewer such partitions (15 has four). See A000005 comments and A038547 formula. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Apr 20 2008
|
|
EXAMPLE
|
E.g.: 9 is in list because has 3 divisors (1, 3, 9), more than any previous odd number.
|
|
CROSSREFS
|
Cf. A002182, A053640.
Cf. A000005, A038547.
Sequence in context: A057909 A082702 A065917 this_sequence A119239 A140864 A120403
Adjacent sequences: A053621 A053622 A053623 this_sequence A053625 A053626 A053627
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Stefano Lanfranco (lastefano(AT)yahoo.it), Mar 21 2000
|
|
|
Search completed in 0.002 seconds
|
