cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A218383 Number of nonempty subsets S of the powerset of a set of size n, that have the odd intersection property.

Original entry on oeis.org

1, 6, 63, 2880, 1942305, 270460574370, 2342736463012620110115, 86772003564839307585762726826882765841700, 59169757600268575861444773339439520868680468342509442047838072019506515900898085
Offset: 1

Views

Author

Michel Marcus, Oct 27 2012

Keywords

Comments

A being a set, S belonging to P(P(A)) \ {{}} has the odd intersection property (oip) if there exists a set B (necessarily nonempty) included in A with |B∩s| odd for each s in S.
For instance for S={{1}, {1,2}} of A={1,2}, let's take B={1}, then |{1}∩{1}|=1 (odd) and |{1}∩{1,2}|=1 (odd), so S has oip.

Examples

			For |A|=2, A = {1,2} and P(A) = {{}, {1}, {2}, {1,2}}
S can be
{{}, {1}, {2}, {1,2}}
{{}, {1}, {2}}
{{}, {1}, {1,2}}
{{}, {2}, {1,2}}
{{1}, {2}, {1,2}}
{{}, {1}}
{{}, {2}}
{{}, {1,2}}
{{1}, {1,2}} has oip, with B={1}
{{2}, {1,2}} has oip, with B={2}
{{1},{2}} has oip, with B={1, 2}
{{}}
{{1}} has oip, with B={1}
{{2}} has oip, with B={2}
{{1,2}} has oip, with B={1}
So we have 6 S with oip.
		

Crossrefs

Cf. A218384.

Programs

  • Maxima
    A218383[n]:=sum(((-1)^(n-i-1))*(2^(2^i)-1)*prod((2^(n-j+1)-1)/(2^j-1),j,1,i)* prod(2^j-1,j,1,n-i),i,0,n-1)$ makelist(A218383[n],n,1,9); /* Martin Ettl, Oct 30 2012 */
  • PARI
    d(m) = {for (n=1, m,v = sum(i=0, n-1, ((-1)^(n-i-1))*(2^(2^i)-1)* prod(j=1,i, (2^(n-j+1)-1)/(2^j-1))*prod(j=1,n-i,2^j-1));print1(v, ", "););}
    

Formula

a(n) = sum(i=0, n-1, ((-1)^(n-i-1))*(2^(2^i)-1)*prod(j=1,i,(2^(n-j+1)-1)/ (2^j-1)) * prod(j=1,n-i,2^j-1)).