login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050332 Number of factorizations of n into distinct numbers with an odd number of prime factors. 1
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; 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).

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: A115861 A199322 A005087 * A029425 A025902 A053692

Adjacent sequences:  A050329 A050330 A050331 * A050333 A050334 A050335

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:04 EST 2012. Contains 206022 sequences.