The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A050332 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A050332

Number of factorizations of n into distinct numbers with an odd number of prime factors.
(history; published version)

#12 by R. J. Mathar at Fri May 26 04:28:38 EDT 2017

STATUS

editing

approved

#11 by R. J. Mathar at Fri May 26 04:28:25 EDT 2017

FORMULA

a(n) = A050333(A101296(n)). - R. J. Mathar, May 26 2017

STATUS

approved

editing

#10 by R. J. Mathar at Thu May 25 15:23:36 EDT 2017

STATUS

editing

approved

#9 by R. J. Mathar at Thu May 25 15:23:20 EDT 2017

LINKS

R. J. Mathar, <a href="/A050332/b050332.txt">Table of n, a(n) for n = 1..2519</a>

STATUS

approved

editing

#8 by Joerg Arndt at Sat Dec 19 14:15:43 EST 2015

STATUS

reviewed

approved

#7 by Michel Marcus at Sat Dec 19 13:31:20 EST 2015

STATUS

proposed

reviewed

#6 by Jon E. Schoenfield at Sat Dec 19 13:23:52 EST 2015

STATUS

editing

proposed

#5 by Jon E. Schoenfield at Sat Dec 19 13:23:49 EST 2015

COMMENTS

a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).

FORMULA

Dirichlet g.f.: prodProduct_{n is in A026424}(1+1/n^s).

AUTHOR

Christian G. Bower, Oct 15 1999.

STATUS

approved

editing

#4 by Russ Cox at Fri Mar 30 17:37:07 EDT 2012

AUTHOR

_Christian G. Bower (bowerc(AT)usa.net), _, Oct 15 1999.

Discussion

Fri Mar 30

17:37

OEIS Server: https://oeis.org/edit/global/178

#3 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

Factorizations Number of factorizations of n into distinct numbers with an odd number of prime factors.

KEYWORD

nonn,new

nonn