A050358 Number of ordered factorizations of n with 3 levels of parentheses.
1, 1, 1, 5, 1, 9, 1, 25, 5, 9, 1, 65, 1, 9, 9, 125, 1, 65, 1, 65, 9, 9, 1, 425, 5, 9, 25, 65, 1, 121, 1, 625, 9, 9, 9, 605, 1, 9, 9, 425, 1, 121, 1, 65, 65, 9, 1, 2625, 5, 65, 9, 65, 1, 425, 9, 425, 9, 9, 1, 1145, 1, 9, 65, 3125, 9, 121, 1, 65, 9, 121, 1, 4825, 1, 9, 65, 65, 9, 121
Offset: 1
Keywords
Examples
6 = (((6))) = (((3*2))) = (((2*3))) = (((3)*(2))) = (((2)*(3))) = (((3))*((2))) = (((2))*((3))) = (((3)))*(((2))) = (((2)))*(((3))).
Links
- R. J. Mathar, Table of n, a(n) for n = 1..899
Formula
Dirichlet g.f.: (4-3*zeta(s))/(5-4*zeta(s)).
Sum_{k=1..n} a(k) ~ -n^r / (16*r*Zeta'(r)), where r = 2.7884327053324956670606046076818023223650950899573090550836329583345... is the root of the equation Zeta(r) = 5/4. - Vaclav Kotesovec, Feb 02 2019
Comments