Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A229334

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Product of numbers of elements of nonempty subsets of divisors of n.
(history; published version)
#7 by Jon E. Schoenfield at Fri Dec 11 22:04:33 EST 2015
STATUS

editing

approved

#6 by Jon E. Schoenfield at Fri Dec 11 22:04:31 EST 2015
NAME

Product of numbers of elements of non-empty nonempty subsets of divisors of n.

COMMENTS

Number of non-empty nonempty subsets of divisors of n = A100587(n).

EXAMPLE

For n = 4; divisors of 4: {1, 2, 4}; non-empty nonempty subsets of divisors of n: {1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {1, 2, 4}; product of numbers of elements of subsets = 1*1*1*2*2*2*3 = 24.

CROSSREFS
STATUS

approved

editing

#5 by T. D. Noe at Tue Oct 01 16:02:01 EDT 2013
STATUS

editing

approved

#4 by T. D. Noe at Tue Oct 01 16:01:58 EDT 2013
DATA

1, 2, 2, 24, 2, 20736, 2, 20736, 24, 20736, 2, 11501279977342425366528000000, 2, 20736, 20736, 309586821120, 2, 11501279977342425366528000000, 2, 11501279977342425366528000000, 20736, 20736, 2, 76958943408207994310451133909928754016691287539660927138035169837998325372031682525056204800000000000000000000000000000000000000000000000000000000

FORMULA

a(n) = product[k=1..tau(n)] k^C(tau(n),k) = product[k=1..tau(n)] k^(tau(n)!/((tau(n)-k)!*k!)).

MATHEMATICA

Table[Times @@ Rest[Length /@ Subsets[Divisors[n]]], {n, 23}] (* T. D. Noe, Oct 01 2013 *)

STATUS

proposed

editing

#3 by Jaroslav Krizek at Mon Sep 30 05:19:50 EDT 2013
STATUS

editing

proposed

#2 by Jaroslav Krizek at Mon Sep 30 05:19:35 EDT 2013
NAME

allocated for Jaroslav KrizekProduct of numbers of elements of non-empty subsets of divisors of n.

DATA

1, 2, 2, 24, 2, 20736, 2, 20736, 24, 20736, 2, 11501279977342425366528000000, 2, 20736, 20736, 309586821120, 2, 11501279977342425366528000000, 2, 11501279977342425366528000000, 20736, 20736, 2, 76958943408207994310451133909928754016691287539660927138035169837998325372031682525056204800000000000000000000000000000000000000000000000000000000

OFFSET

1,2

COMMENTS

Number of non-empty subsets of divisors of n = A100587(n).

Also product of sizes of all the subsets of set of divisors of n.

FORMULA

a(n) = product[k=1…tau(n)] k^C(tau(n),k) = product[k=1…tau(n)] k^(tau(n)!/((tau(n)-k)!*k!)).

EXAMPLE

For n = 4; divisors of 4: {1, 2, 4}; non-empty subsets of divisors of n: {1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {1, 2, 4}; product of numbers of elements of subsets = 1*1*1*2*2*2*3 = 24.

For n = 4; tau(4) = 3; a(4) = [1^(3!/((3-1)!*1!))] * [2^(3!/((3-2)!*2!))] * [3^(3!/((3-3)!*3!))] = 1^3 * 2^3 * 3^1 = 24.

CROSSREFS
KEYWORD

allocated

nonn

AUTHOR

Jaroslav Krizek, Sep 30 2013

STATUS

approved

editing

#1 by Jaroslav Krizek at Fri Sep 20 08:51:18 EDT 2013
NAME

allocated for Jaroslav Krizek

KEYWORD

allocated

STATUS

approved