Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051368
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051368 Number of Boolean functions of n variables and rank 8 from the Post class F(5,2). +0
1
0, 0, 0, 12, 105765, 59046810, 16636450912, 3491313542424, 627725748292995, 102894277877828670, 15867914519581210614, 2343602605748557069356, 335205287948366997151705, 46782266953279485879549090 (list; graph; listen)
OFFSET

1,4

REFERENCES

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

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).

LINKS

Index entries for sequences related to Boolean functions

FORMULA

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

CROSSREFS

Sequence in context: A134714 A127223 A076691 this_sequence A103482 A056540 A069048

Adjacent sequences: A051365 A051366 A051367 this_sequence A051369 A051370 A051371

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research