proposed
approved
proposed
approved
editing
proposed
a(n) depends only on the prime signature of n. - Andrew Howroyd, Feb 03 2021
Andrew Howroyd, <a href="/A335452/b335452.txt">Table of n, a(n) for n = 1..4096</a>
(PARI)
F(i, j, r, t) = {sum(k=max(0, i-j), min(min(i, t), (i-j+t)\2), binomial(i, k)*binomial(r-i+1, t+i-j-2*k)*binomial(t-1, k-i+j))}
count(sig)={my(s=vecsum(sig), r=0, v=[1]); for(p=1, #sig, my(t=sig[p]); v=vector(s-r-t+1, j, sum(i=1, #v, v[i]*F(i-1, j-1, r, t))); r += t); v[1]}
a(n)={count(factor(n)[, 2])} \\ Andrew Howroyd, Feb 03 2021
approved
editing
proposed
approved
editing
proposed
Separations are counted by A003242 and ranked by A333489.
Carlitz compositions (separations, anti-runs) are counted by A003242 and ranked by A333489 stc_anti_run.
Strict permutations are counted by A335489.
Cf. A000961, A005117, A056239, A112798, A181796, A333221, A335451, A335454, A335465, A335489.