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.

A087084 Number of integer elements in the subsets of the subsets of the integers 1 to n.

Original entry on oeis.org

0, 0, 2, 32, 1536, 1048576, 171798691840, 1770887431076116955136, 76223250190290215815795912064716079366144
Offset: 0

Views

Author

Alan Sutcliffe (alansut(AT)ntlworld.com), Aug 13 2003

Keywords

Examples

			a(3)=32 since the 16 subsets of the sets ( ) (1) (2) (1,2) are ( ) (( )) ((1)) ((2)) ((1,2)) (( ) (1)) (( ) (2)) (( ) (1,2)) ((1) (2)) ((1) (1,2)) ((2) (1,2)) (( ) (1) (2)) (( ) (1) (1,2)) (( ) (2) (1,2)) ((1) (2) (1,2)) (( ) (1) (2) (1,2)) and these contain 32 integer elements.
		

References

  • Alan Sutcliffe, Divisors and Common Factors in Sets of Integers, awaiting publication.

Crossrefs

A001146 gives the number of subsets of the subsets of the integers 1 to n. A028369 gives the number of subset elements in the subsets of the subsets of the integers 1 to n.

Formula

(n-1)*2^(n-3+2^(n-1))