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.

A318950 Regular triangle where T(n,k) is the number of factorizations of n into factors > 1 with sum k.

This page as a plain text file.
%I A318950 #17 Oct 22 2018 17:41:58
%S A318950 0,0,1,0,0,1,0,0,0,2,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,2,
%T A318950 0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,
%U A318950 0,0,0,0,2,1,0,0,0,1,0,0,0,0,0,0,0,0,0
%N A318950 Regular triangle where T(n,k) is the number of factorizations of n into factors > 1 with sum k.
%e A318950 Triangle begins:
%e A318950   0
%e A318950   0 1
%e A318950   0 0 1
%e A318950   0 0 0 2
%e A318950   0 0 0 0 1
%e A318950   0 0 0 0 1 1
%e A318950   0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 2 0 1
%e A318950   0 0 0 0 0 1 0 0 1
%e A318950   0 0 0 0 0 0 1 0 0 1
%e A318950   0 0 0 0 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 2 1 0 0 0 1
%e A318950   0 0 0 0 0 0 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 0 1 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 1 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 3 0 1 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
%e A318950   0 0 0 0 0 0 0 0 2 0 0 1 0 0 0 0 0 0 0 1
%e A318950 Row 12 {0,0,0,0,0,0,2,1,0,0,0,1} corresponds to the factorizations:
%e A318950   . . . . . . (3*4)   (2*6) . . . (12)
%e A318950               (2*2*3)
%t A318950 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A318950 Table[Length[Select[facs[n],Total[#]==k&]],{n,20},{k,n}]
%Y A318950 Row sums are A001055. Column sums are A002865.
%Y A318950 Cf. A069016, A096276, A301987, A319000, A319005, A319057, A319916.
%K A318950 nonn,tabl
%O A318950 1,10
%A A318950 _Gus Wiseman_, Oct 22 2018