This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095683 Number of prime power divisors of n. If n=product p_i^r_i then d=product {p_i^s_i, 2<=s_i<=r_i, s_i is prime} is a prime power divisor of n. 1
 1, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS FORMULA Multiplicative with a(p^e) = A000720(e). - Vladeta Jovovic, Jul 06 2004 EXAMPLE n=16: prime power divisors of 16 are {2^2, 2^3}, so a(16)=2. CROSSREFS Sequence in context: A124749 A127844 A017877 * A219481 A074079 A037858 Adjacent sequences:  A095680 A095681 A095682 * A095684 A095685 A095686 KEYWORD nonn,mult AUTHOR Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp) EXTENSIONS More terms from Vladeta Jovovic, Jul 06 2004 STATUS approved

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 .