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 A322076 #5 Nov 26 2018 17:04:45 %S A322076 1,0,0,1,0,0,0,1,1,0,0,1,0,0,0,4,0,1,0,0,0,0,0,3,1,0,2,0,0,1,0,11,0,0, %T A322076 0,5,0,0,0,1,0,0,0,0,1,0,0,13,1,1,0,0,0,7,0,0,0,0,0,3,0,0,1,41,0,0,0, %U A322076 0,0,1,0,20,0,0,2,0,0,0,0,6,16,0,0,1,0 %N A322076 Number of set multipartitions (multisets of sets) with no singletons, of a multiset whose multiplicities are the prime indices of n. %C A322076 This multiset (row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}. %e A322076 The a(90) = 7 set multipartitions of {1,1,1,2,2,3,3,4} with no singletons: %e A322076 {{1,2},{1,2},{1,3},{3,4}} %e A322076 {{1,2},{1,3},{1,3},{2,4}} %e A322076 {{1,2},{1,3},{1,4},{2,3}} %e A322076 {{1,2},{1,3},{1,2,3,4}} %e A322076 {{1,2},{1,2,3},{1,3,4}} %e A322076 {{1,3},{1,2,3},{1,2,4}} %e A322076 {{1,4},{1,2,3},{1,2,3}} %t A322076 nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]]; %t A322076 sqnopfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sqnopfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],!PrimeQ[#]&&SquareFreeQ[#]&]}]]; %t A322076 Table[Length[sqnopfacs[Times@@Prime/@nrmptn[n]]],{n,30}] %Y A322076 Cf. A001055, A007716, A049311, A056156, A116540, A181821, A255906, A304382. %Y A322076 Cf. A318284, A318286, A318360, A318361, A318362, A318369. %K A322076 nonn %O A322076 1,16 %A A322076 _Gus Wiseman_, Nov 25 2018