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.
%I A305832 #5 Jun 11 2018 13:13:13
%S A305832 0,1,1,1,1,2,1,2,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,3,1,2,1,2,1,3,1,2,2,2,
%T A305832 2,1,1,2,1,3,1,3,1,2,2,2,1,2,1,2,1,2,1,2,2,3,2,2,1,3,1,2,2,2,1,3,1,2,
%U A305832 2,3,1,2,1,2,2,2,2,2,1,2,1,2,1,3,2,2,1
%N A305832 Number of connected components of the n-th FDH set-system.
%C A305832 Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. Every positive integer n has a unique factorization of the form n = f(s_1)*...*f(s_k) where the s_i are strictly increasing positive integers. The n-th FDH set-system is obtained by repeating this factorization on each index s_i.
%e A305832 Let f = A050376. The FD-factorization of 765 is 5*9*17 or f(4)*f(6)*f(10) = f(4)*f(2*3)*f(2*5) with connected components {{{4}},{{2,3},{2,5}}}, so a(765) = 2.
%t A305832 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 A305832 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 A305832 nn=100;FDprimeList=Array[FDfactor,nn,1,Union];FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
%t A305832 Table[Length[csm[FDfactor[#]/.FDrules&/@(FDfactor[n]/.FDrules)]],{n,nn}]
%Y A305832 Cf. A048143, A050376, A064547, A213925, A299755, A299756, A304714, A304716, A305078, A305079, A305829, A305830, A305831.
%K A305832 nonn
%O A305832 1,6
%A A305832 _Gus Wiseman_, Jun 10 2018