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”).

A305148
Number of integer partitions of n whose distinct parts are pairwise indivisible.
34
1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 12, 12, 17, 20, 22, 28, 35, 39, 48, 55, 65, 79, 90, 105, 121, 143, 166, 190, 219, 254, 290, 332, 382, 436, 493, 567, 637, 729, 824, 931, 1052, 1186, 1334, 1504, 1691, 1894, 2123, 2380, 2664, 2968, 3319, 3704, 4119, 4586, 5110
OFFSET
0,3
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..360 (terms 0..300 from Alois P. Heinz)
EXAMPLE
The a(9) = 7 integer partitions are (9), (72), (54), (522), (333), (3222), (111111111).
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], Select[Tuples[Union[#], 2], UnsameQ@@#&&Divisible@@#&]=={}&]], {n, 20}]
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 26 2018
EXTENSIONS
More terms from Alois P. Heinz, May 26 2018
STATUS
approved