cp's OEIS Frontend

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.

A275780 Number of set partitions of [n] into blocks with distinct element sums.

This page as a plain text file.
%I A275780 #22 Aug 30 2024 18:32:43
%S A275780 1,1,2,4,12,43,160,668,3098,15465,83100,477651,2914505,18795814,
%T A275780 127790544,911448954,6808162094,53067398065,430956571977,
%U A275780 3636314065247,31841519540324,288664242344692,2706949104147162,26205222185730884,261681461422075548,2691088457402830312
%N A275780 Number of set partitions of [n] into blocks with distinct element sums.
%H A275780 Gus Wiseman, <a href="/A038041/a038041.txt">Sequences counting and ranking multiset partitions whose part lengths, sums, or averages are constant or strict.</a>
%F A275780 a(n) = A000110(n) - A275781(n).
%e A275780 a(3) = 4: 123, 13|2, 1|23, 1|2|3.
%e A275780 a(4) = 12: 1234, 123|4, 124|3, 12|34, 134|2, 13|24, 1|234, 1|23|4, 14|2|3, 1|24|3, 1|2|34, 1|2|3|4.
%t A275780 sps[{}]:={{}};sps[set:{i_,___}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,___}];
%t A275780 Table[Length[Select[sps[Range[n]],UnsameQ@@Total/@#&]],{n,0,10}] (* _Gus Wiseman_, Jul 13 2019 *)
%Y A275780 Cf. A000110, A007837, A035470, A038041, A275781, A278339, A300335, A321469, A326512, A326513, A326519, A326535.
%K A275780 nonn
%O A275780 0,3
%A A275780 _Alois P. Heinz_, Aug 08 2016
%E A275780 a(17)-a(25) from _Christian Sievers_, Aug 20 2024