Let $S_n$ is acting on set of boolean functions of size $n$ in the following way:

If $f$ is a boolean function and $\alpha \in S_n$, then $g=\alpha f$ and $g(x)=f(\alpha(x))$ where $x$ is boolean vector of size $n$;

Let $p$ is number of orbits. Since each orbit can have no more than $n!$ elements it is obvious that $p\ge\frac{2^{2^n}}{n!}$.

I am interested in upper bound of $p$. Do you know any results related to it?

Let $S_n$ act on the set of boolean functions of size $n$ in the following way:

If $f$ is a boolean function and $\alpha \in S_n$, then $g=\alpha f$ and $g(x)=f(\alpha(x))$ where $x$ is boolean vector of size $n$;

Let $p$ be the number of orbits. Since each orbit can have no more than $n!$ elements it is obvious that $p\ge\frac{2^{2^n}}{n!}$.

I am interested in an upper bound of $p$. Do you know any related results?