|
Search: id:A028403
|
|
|
| A028403 |
|
Number of types of Boolean functions of n variables under a certain group. |
|
+0
7
|
|
| 4, 12, 40, 144, 544, 2112, 8320, 33024, 131584, 525312, 2099200, 8392704, 33562624, 134234112, 536903680, 2147549184, 8590065664, 34360000512, 137439477760, 549756862464, 2199025352704, 8796097216512, 35184380477440
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(1) written in base 2: 100 (A163450(1)). a(n) for n >= 2 written in base 2: 1100, 101000, 10010000, 1000100000, ..., i.e. number 1, (n-2) times 0, number 1 and n times 0 (A163450(n) for n >= 2). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jul 27 2009]
|
|
REFERENCES
|
I. Strazdins, Universal affine classification of Boolean functions, Acta Applic. Math. 46 (1997), 147-167.
|
|
LINKS
|
Index entries for sequences related to Boolean functions
|
|
FORMULA
|
Appears to be 2*A007582(n-1). - R. Stephan, Mar 24 2004
a(n) = A000079(n) * (A000079(n-1) + 1) = (A00051(n) - 1) * A000051(n-1) = A000079(n) * A000051(n-1) = (A00051(n) - 1) * (A000079(n-1) + 1) = 2^n * (2^(n-1) + 1). a(n+1) = A000079(n+1) * (A000079(n) + 1) = (A00051(n+1) - 1) * A000051(n) = A000079(n+1) * A000051(n) = (A00051(n+1) - 1) * (A000079(n) + 1) = 2^(n+1) * (2^n + 1). a(n) = A081294(n) + A000079(n) = A004171(n-1) + A000079(n) = 2^(2n-1) + 2^n. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jul 27 2009]
|
|
CROSSREFS
|
Sequence in context: A149333 A074032 A074450 this_sequence A149334 A149335 A149336
Adjacent sequences: A028400 A028401 A028402 this_sequence A028404 A028405 A028406
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 24 2000
|
|
|
Search completed in 0.002 seconds
|
