login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283260 Product of the products of elements of all the nonempty subsets of the sets of numbers from 1 to n. 1
1, 4, 1296, 110075314176, 1848842588950364160000000000000000, 27204445973673520186989292010512474445356561349778469394841600000000000000000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(7) has 237 digits.
LINKS
FORMULA
a(n) = (n!)^(2^(n-1)).
EXAMPLE
Rows with nonempty subsets of the sets of numbers from 1 to n:
{1};
{1}, {2}, {1, 2};
{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3};
...
Rows with the products of elements of these subsets:
1;
1, 2, 2;
1, 2, 3, 2, 3, 6, 6;
...
a(1) = (1), a(2) = (1*2*2) = 4, a(3) = (1*2*3*2*3*6*6) = 1296, ...
PROG
(PARI) a(n)=n!^2^(n-1) \\ Charles R Greathouse IV, Mar 06 2017
CROSSREFS
Sequence in context: A324299 A227850 A079711 * A217601 A172925 A167071
KEYWORD
nonn,easy
AUTHOR
Jaroslav Krizek, Mar 04 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 19:27 EST 2023. Contains 367526 sequences. (Running on oeis4.)