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

A087085
Sum of the integer elements in the subsets of the subsets of the integers 1 to n.
0
0, 0, 2, 48, 3072, 2621440, 515396075520, 6198106008766409342976, 304893000761160863263183648258864317464576
OFFSET
0,3
REFERENCES
Alan Sutcliffe, Divisors and Common Factors in Sets of Integers, awaiting publication.
FORMULA
n*(n-1)*2^(n-4+2^(n-1))
EXAMPLE
a(3)=48 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 the sum of the 32 integer elements is 48.
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. A087084 gives the number of integer elements in the subsets of the subsets of the integers 1 to n.
Sequence in context: A322750 A367537 A346019 * A067626 A053071 A238838
KEYWORD
easy,nonn
AUTHOR
Alan Sutcliffe (alansut(AT)ntlworld.com), Aug 13 2003
STATUS
approved