OFFSET
1,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..12
V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138.
V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, (English translation), Discrete Mathematics and Applications, 9, (1999), no. 6.
S. Spasovski and A. M. Bogdanova, Optimization of the Polynomial Greedy Solution for the Set Covering Problem, 2013, 10th Conference for Informatics and Information Technology (CIIT 2013).
FORMULA
a(n) = Sum_{j=1..n} (-1)^(j+1)*C(n, j)*2^(2^(n-j)-1).
MATHEMATICA
Table[Sum[(-1)^(j + 1)*Binomial[n, j]*2^(2^(n - j) - 1) , {j, 1, n}], {n, 1, 5}] (* G. C. Greubel, Oct 08 2017 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Goran Kilibarda
EXTENSIONS
More terms from James A. Sellers
STATUS
approved