login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A342096
Number of integer partitions of n with no adjacent parts having quotient >= 2.
37
1, 2, 2, 3, 3, 4, 4, 6, 6, 8, 9, 11, 13, 17, 19, 24, 29, 35, 42, 51, 61, 75, 90, 108, 130, 158, 189, 227, 272, 325, 389, 464, 553, 659, 782, 929, 1102, 1306, 1545, 1824, 2153, 2538, 2989, 3514, 4127, 4842, 5673, 6642, 7766, 9068, 10583, 12335, 14361, 16705
OFFSET
1,2
COMMENTS
The decapitation of such a partition (delete the greatest part) is term-wise greater than its negated first-differences.
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 1..250
EXAMPLE
The a(1) = 1 through a(10) = 8 partitions:
1 2 3 4 5 6 7 8 9 A
11 111 22 32 33 43 44 54 55
1111 11111 222 322 53 333 64
111111 1111111 332 432 433
2222 3222 532
11111111 111111111 3322
22222
1111111111
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], And@@Thread[Differences[-#]<Rest[#]]&]], {n, 30}]
CROSSREFS
The case of equality (all adjacent parts having quotient 2) is A154402.
The multiplicative version is A342083 or A342084.
The version allowing quotients of 2 exactly is A342094.
The strict case allowing quotients of 2 exactly is A342095.
The strict case is A342097.
The reciprocal version is A342098.
A000009 counts strict partitions.
A000929 counts partitions with no adjacent parts having quotient < 2.
A003114 counts partitions with adjacent parts differing by more than 1.
A034296 counts partitions with adjacent parts differing by at most 1.
Sequence in context: A026799 A185326 A238209 * A210716 A027190 A036824
KEYWORD
nonn
AUTHOR
Gus Wiseman, Mar 02 2021
STATUS
approved