OFFSET
0,4
COMMENTS
Alternative name: Number of strict integer partitions of n with a part dividing all the others and a part divisible by all the others.
EXAMPLE
The a(1) = 1 through a(15) = 6 partitions (A..F = 10..15):
1 2 3 4 5 6 7 8 9 A B C D E F
21 31 41 42 61 62 63 82 A1 84 C1 C2 A5
51 421 71 81 91 821 93 841 D1 C3
621 631 A2 931 842 E1
B1 A21 C21
6321 8421
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], #=={}||UnsameQ@@#&&And@@IntegerQ/@(#/Min@@#)&&And@@IntegerQ/@(Max@@#/#)&]], {n, 0, 30}]
CROSSREFS
The first condition alone gives A097986.
The second condition alone gives A343347.
The opposite version is A343379.
The strict complement is counted by A343382.
A000009 counts strict partitions.
A000070 counts partitions with a selected part.
A006128 counts partitions with a selected position.
A015723 counts strict partitions with a selected part.
A167865 counts strict chains of divisors > 1 summing to n.
A339564 counts factorizations with a selected factor.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 16 2021
STATUS
approved