This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A342514 #12 Feb 16 2025 08:34:01
%S A342514 1,1,2,2,4,5,6,8,11,14,18,24,28,35,41,52,64,81,93,115,137,157,190,225,
%T A342514 268,313,366,430,502,587,683,790,913,1055,1217,1393,1605,1830,2098,
%U A342514 2384,2722,3101,3524,4005,4524,5137,5812,6570,7434,8360,9416,10602,11881
%N A342514 Number of integer partitions of n with distinct first quotients.
%C A342514 Also the number of reversed integer partitions of n with distinct first quotients.
%C A342514 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).
%H A342514 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LogarithmicallyConcaveSequence.html">Logarithmically Concave Sequence</a>.
%H A342514 Gus Wiseman, <a href="/A325325/a325325.txt">Sequences counting and ranking integer partitions by the differences of their successive parts</a>.
%H A342514 Gus Wiseman, <a href="/A069916/a069916.txt">Sequences counting and ranking partitions and compositions by their differences and quotients</a>.
%e A342514 The partition (4,3,3,2,1) has first quotients (3/4,1,2/3,1/2) so is counted under a(13), but it has first differences (-1,0,-1,-1) so is not counted under A325325(13).
%e A342514 The a(1) = 1 through a(9) = 14 partitions:
%e A342514 (1) (2) (3) (4) (5) (6) (7) (8) (9)
%e A342514 (11) (21) (22) (32) (33) (43) (44) (54)
%e A342514 (31) (41) (42) (52) (53) (63)
%e A342514 (211) (221) (51) (61) (62) (72)
%e A342514 (311) (321) (322) (71) (81)
%e A342514 (411) (331) (332) (432)
%e A342514 (511) (422) (441)
%e A342514 (3211) (431) (522)
%e A342514 (521) (531)
%e A342514 (611) (621)
%e A342514 (3221) (711)
%e A342514 (3321)
%e A342514 (4311)
%e A342514 (5211)
%t A342514 Table[Length[Select[IntegerPartitions[n],UnsameQ@@Divide@@@Partition[#,2,1]&]],{n,0,30}]
%Y A342514 The version for differences instead of quotients is A325325.
%Y A342514 The ordered version is A342529.
%Y A342514 The strict case is A342520.
%Y A342514 The Heinz numbers of these partitions are A342521.
%Y A342514 A000005 counts constant partitions.
%Y A342514 A000009 counts strict partitions.
%Y A342514 A000041 counts partitions.
%Y A342514 A001055 counts factorizations (strict: A045778, ordered: A074206).
%Y A342514 A003238 counts chains of divisors summing to n - 1 (strict: A122651).
%Y A342514 A167865 counts strict chains of divisors > 1 summing to n.
%Y A342514 A342096 counts partitions with all adjacent parts x < 2y (strict: A342097).
%Y A342514 A342098 counts partitions with all adjacent parts x > 2y.
%Y A342514 Cf. A000837, A002843, A003242, A175342, A318991, A318992, A325557, A342527, A342528, A342529.
%K A342514 nonn
%O A342514 0,3
%A A342514 _Gus Wiseman_, Mar 17 2021