OFFSET
0,2
COMMENTS
A Boolean function is degenerate on some variable if its output does not depend on the variable, and it is said to be non-degenerate if it is not degenerate on any variable.
LINKS
Aniruddha Biswas and Palash Sarkar, Counting unate and balanced monotone Boolean functions, arXiv:2304.14069 [math.CO], 2023.
Aniruddha Biswas and Palash Sarkar, Counting Unate and Monotone Boolean Functions Under Restrictions of Balancedness and Non-Degeneracy, J. Int. Seq. (2025) Vol. 28, Art. No. 25.3.4. See pp. 4, 6.
FORMULA
a(n) = Sum_{i=1..n} (-1)^(n-i) * binomial(n,i) * binomial(2^i,2^(i-1)).
MATHEMATICA
a[n_]:=Sum[(-1)^(n-i)*Binomial[n, i]*Binomial[2^i, 2^(i-1)], {i, n}]; Array[a, 9, 0] (* Stefano Spezia, Nov 24 2024 *)
PROG
(Python)
from math import comb
def A378302(n): return sum(-comb(n, i)*comb(1<<n-i, 1<<n-i-1) if i&1 else comb(n, i)*comb(1<<n-i, 1<<n-i-1) for i in range(n)) # Chai Wah Wu, Dec 11 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Aniruddha Biswas, Nov 22 2024
STATUS
approved
