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.

A294787 Number of ways to choose a set partition of a factorization of n into distinct factors greater than one.

This page as a plain text file.
%I A294787 #7 Nov 16 2017 05:30:52
%S A294787 1,1,1,1,1,3,1,3,1,3,1,5,1,3,3,3,1,5,1,5,3,3,1,12,1,3,3,5,1,12,1,5,3,
%T A294787 3,3,12,1,3,3,12,1,12,1,5,5,3,1,19,1,5,3,5,1,12,3,12,3,3,1,26,1,3,5,
%U A294787 10,3,12,1,5,3,12,1,26,1,3,5,5,3,12,1,19,3,3
%N A294787 Number of ways to choose a set partition of a factorization of n into distinct factors greater than one.
%F A294787 A294786(n) <= a(n) <= A294788(n).
%t A294787 strfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[strfacs[n/d],Min@@#>d&]],{d,Rest[Divisors[n]]}]];
%t A294787 Table[Total[BellB/@Length/@strfacs[n]],{n,100}]
%Y A294787 Cf. A001055, A045778, A279375, A281113, A294617, A294786, A294788.
%K A294787 nonn
%O A294787 1,6
%A A294787 _Gus Wiseman_, Nov 08 2017