login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of Boolean functions of n variables and rank 8 from the Post class F(5,2).
0

%I #10 Jun 13 2013 11:32:14

%S 0,0,0,12,105765,59046810,16636450912,3491313542424,627725748292995,

%T 102894277877828670,15867914519581210614,2343602605748557069356,

%U 335205287948366997151705,46782266953279485879549090

%N Number of Boolean functions of n variables and rank 8 from the Post class F(5,2).

%D E. Post, Two-valued iterative systems, Annals of Mathematics, no 5, Princeton University Press, NY, 1941.

%D 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 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6).

%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>

%F A051184(n)-A051183(n)+A051182(n)-A051181(n)+A051180(n)-A036239(n)+A000918(n)

%K nonn

%O 1,4

%A _Vladeta Jovovic_, Goran Kilibarda