A342497 Number of integer partitions of n with weakly increasing first quotients.

1, 1, 2, 3, 5, 6, 9, 11, 15, 18, 23, 25, 32, 36, 43, 49, 60, 65, 75, 83, 96, 106, 121, 131, 150, 163, 178, 194, 217, 230, 254, 275, 300, 320, 350, 374, 411, 439, 470, 503, 548, 578, 625, 666, 710, 758, 815, 855, 913, 970, 1029, 1085, 1157, 1212, 1288, 1360

Offset

0,3

Comments

Also called log-concave-up partitions.

Also the number of reversed integer partitions of n with weakly increasing first quotients.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

Links

Table of n, a(n) for n=0..55.

Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

Example

The partition y = (6,3,2,1,1) has first quotients (1/2,2/3,1/2,1) so is not counted under a(13). However, the first differences (-3,-1,-1,0) are weakly increasing, so y is counted under A240026(13).
The a(1) = 1 through a(8) = 15 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (211)   (311)    (51)      (61)       (62)
                    (1111)  (2111)   (222)     (322)      (71)
                            (11111)  (411)     (421)      (422)
                                     (3111)    (511)      (521)
                                     (21111)   (4111)     (611)
                                     (111111)  (31111)    (2222)
                                               (211111)   (4211)
                                               (1111111)  (5111)
                                                          (41111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

Mathematica

Table[Length[Select[IntegerPartitions[n], LessEqual@@Divide@@@Reverse/@Partition[#, 2, 1]&]], {n, 0, 30}]

Crossrefs

The version for differences instead of quotients is A240026.

The ordered version is A342492.

The strictly increasing version is A342498.

The weakly decreasing version is A342513.

The strict case is A342516.

The Heinz numbers of these partitions are A342523.

A000005 counts constant partitions.

A000009 counts strict partitions.

A000041 counts partitions.

A000929 counts partitions with all adjacent parts x >= 2y.

A001055 counts factorizations.

A003238 counts chains of divisors summing to n - 1 (strict: A122651).

A074206 counts ordered factorizations.

A167865 counts strict chains of divisors > 1 summing to n.

A342094 counts partitions with all adjacent parts x <= 2y.

Cf. A000837, A002843, A003242, A175342, A318991, A318992, A325557, A342527, A342528, A342529.

Sequence in context: A365877 A325863 A341868 * A028309 A242717 A026810

Adjacent sequences: A342494 A342495 A342496 * A342498 A342499 A342500

Keyword

nonn

Author

Gus Wiseman, Mar 17 2021

Status

approved