OFFSET
0,4
COMMENTS
Also the number of reversed strict partitions of n with strictly 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
Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.
EXAMPLE
The partition (14,8,5,3,2) has first quotients (4/7,5/8,3/5,2/3) so is not counted under a(32), even though the differences (-6,-3,-2,-1) are strictly increasing.
The a(1) = 1 through a(13) = 10 partitions (A..D = 10..13):
1 2 3 4 5 6 7 8 9 A B C D
21 31 32 42 43 53 54 64 65 75 76
41 51 52 62 63 73 74 84 85
61 71 72 82 83 93 94
521 81 91 92 A2 A3
621 532 A1 B1 B2
721 632 732 C1
821 921 643
832
A21
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&Less@@Divide@@@Reverse/@Partition[#, 2, 1]&]], {n, 0, 30}]
CROSSREFS
The version for differences instead of quotients is A179254.
The non-strict ordered version is A342493.
The weakly increasing version is A342516.
The strictly decreasing version is A342518.
A045690 counts sets with maximum n with all adjacent elements y < 2x.
A167865 counts strict chains of divisors > 1 summing to n.
A342098 counts (strict) partitions with all adjacent parts x > 2y.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Mar 20 2021
STATUS
approved