The On-Line Encyclopedia of Integer Sequences (OEIS)

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

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

Other ways to Give

A050332 revision #4

A050332

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

1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,24

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

LINKS

Table of n, a(n) for n=1..103.

FORMULA

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

CROSSREFS

Cf. A026424, A045778, A050333. a(p^k)=A000700. a(A002110)=A003724.

Sequence in context: A341594 A368774 A005087 * A369258 A337930 A340691

Adjacent sequences: A050329 A050330 A050331 * A050333 A050334 A050335

KEYWORD

nonn

AUTHOR

Christian G. Bower, Oct 15 1999.

STATUS

approved