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.

A050347 Number of ways to factor n into distinct factors with 2 levels of parentheses.

This page as a plain text file.
%I A050347 #10 May 26 2017 04:25:26
%S A050347 1,1,1,1,1,4,1,4,1,4,1,10,1,4,4,7,1,10,1,10,4,4,1,26,1,4,4,10,1,22,1,
%T A050347 14,4,4,4,34,1,4,4,26,1,22,1,10,10,4,1,63,1,10,4,10,1,26,4,26,4,4,1,
%U A050347 74,1,4,10,29,4,22,1,10,4,22,1,105,1,4,10,10,4,22,1,63,7,4,1,74,4,4,4,26
%N A050347 Number of ways to factor n into distinct factors with 2 levels of parentheses.
%C A050347 a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).
%H A050347 R. J. Mathar, <a href="/A050347/b050347.txt">Table of n, a(n) for n = 1..2159</a>
%F A050347 Dirichlet g.f.: Product_{n>=2}(1+1/n^s)^A050345(n).
%F A050347 a(n) = A050348(A101296(n)). - _R. J. Mathar_, May 26 2017
%e A050347 6 = ((6)) = ((3*2)) = ((3)*(2)) = ((3))*((2)).
%Y A050347 Cf. A045778, A050345-A050350. a(p^k)=A050343. a(A002110)=A000307.
%K A050347 nonn
%O A050347 1,6
%A A050347 _Christian G. Bower_, Oct 15 1999