cp's OEIS Frontend

A316268 FDH numbers of connected strict integer partitions.

%I A316268 #5 Jun 29 2018 11:35:40
%S A316268 2,3,4,5,7,9,11,13,15,16,17,19,23,25,27,29,31,36,37,39,41,43,45,47,49,
%T A316268 51,53,59,61,64,65,67,69,71,73,79,81,83,85,87,89,92,97,101,103,107,
%U A316268 108,109,111,113,115,117,119,121,124,127,129,131,135,137,139,144
%N A316268 FDH numbers of connected strict integer partitions.
%C A316268 Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. The FDH number of a strict integer partition (y_1,...,y_k) is f(y_1)*...*f(y_k).
%C A316268 Given a finite set S of positive integers greater than one, let G(S) be the simple labeled graph with vertex set S and edges between any two vertices with a common divisor greater than 1. For example, G({6,14,15,35}) is a 4-cycle. A set or strict partition S is said to be connected if G(S) is a connected graph.
%e A316268 Sequence of connected strict integer partitions begins (1), (2), (3), (4), (5), (6), (7), (8), (4,2), (9), (10), (11), (12), (13), (6,2).
%t A316268 nn=100;
%t A316268 FDfactor[n_]:=If[n===1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
%t A316268 FDrules=MapIndexed[(#1->#2[[1]])&,Array[FDfactor,nn,1,Union]];
%t A316268 csm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[OrderedQ[#],UnsameQ@@#,Length[Intersection@@s[[#]]]>1]&]},If[c=={},s,csm[Union[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
%t A316268 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A316268 Select[Range[nn],Length[csm[primeMS/@(FDfactor[#]/.FDrules)]]==1&]
%Y A316268 Cf. A048143, A050376, A064547, A213925, A299755, A299756, A299757, A304714, A304716, A305078, A305079, A305829, A305831.
%K A316268 nonn
%O A316268 1,1
%A A316268 _Gus Wiseman_, Jun 28 2018