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.

A050349 Number of ways to factor n into distinct factors with 3 levels of parentheses.

Original entry on oeis.org

1, 1, 1, 1, 1, 5, 1, 5, 1, 5, 1, 15, 1, 5, 5, 11, 1, 15, 1, 15, 5, 5, 1, 45, 1, 5, 5, 15, 1, 35, 1, 25, 5, 5, 5, 65, 1, 5, 5, 45, 1, 35, 1, 15, 15, 5, 1, 130, 1, 15, 5, 15, 1, 45, 5, 45, 5, 5, 1, 145, 1, 5, 15, 60, 5, 35, 1, 15, 5, 35, 1, 240, 1, 5, 15, 15, 5, 35, 1, 130, 11, 5, 1, 145, 5
Offset: 1

Views

Author

Christian G. Bower, Oct 15 1999

Keywords

Comments

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).

Examples

			6 = (((6))) = (((3*2))) = (((3)*(2))) = (((3))*((2))) = (((3)))*(((2))).
		

Crossrefs

Formula

Dirichlet g.f.: Product_{n>=2}(1+1/n^s)^A050347(n).
a(n) = A050350(A101296(n)). - R. J. Mathar, May 26 2017