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

A087084
Number of integer elements in the subsets of the subsets of the integers 1 to n.
1
0, 0, 2, 32, 1536, 1048576, 171798691840, 1770887431076116955136, 76223250190290215815795912064716079366144
OFFSET
0,3
REFERENCES
Alan Sutcliffe, Divisors and Common Factors in Sets of Integers, awaiting publication.
FORMULA
(n-1)*2^(n-3+2^(n-1))
EXAMPLE
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.
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.
Sequence in context: A172286 A129348 A280211 * A193269 A088386 A329928
KEYWORD
easy,nonn
AUTHOR
Alan Sutcliffe (alansut(AT)ntlworld.com), Aug 13 2003
STATUS
approved