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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136566 a(n) = sum of the exponents occurring only once each in the prime-factorization of n. 3
0, 1, 1, 2, 1, 0, 1, 3, 2, 0, 1, 3, 1, 0, 0, 4, 1, 3, 1, 3, 0, 0, 1, 4, 2, 0, 3, 3, 1, 0, 1, 5, 0, 0, 0, 0, 1, 0, 0, 4, 1, 0, 1, 3, 3, 0, 1, 5, 2, 3, 0, 3, 1, 4, 0, 4, 0, 0, 1, 2, 1, 0, 3, 6, 0, 0, 1, 3, 0, 0, 1, 5, 1, 0, 3, 3, 0, 0, 1, 5, 4, 0, 1, 2, 0, 0, 0, 4, 1, 2, 0, 3, 0, 0, 0, 6, 1, 3, 3, 0, 1, 0, 1, 4, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

Diana Mecum, Table of n, a(n) for n = 1..1000

EXAMPLE

4200 = 2^3 * 3^1 * 5^2 * 7^1. The exponents of the prime factorization are therefore 3,1,2,1. The exponents occurring exactly once are 2 and 3. So a(4200) = 2+3 = 5.

CROSSREFS

Cf. A136565, A136567.

Sequence in context: A171963 A100995 A129353 * A048983 A118344 A119270

Adjacent sequences:  A136563 A136564 A136565 * A136567 A136568 A136569

KEYWORD

nonn

AUTHOR

Leroy Quet, Jan 07 2008

EXTENSIONS

More terms from Diana Mecum (diana.mecum(AT)gmail.com), Jul 17 2008

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 00:09 EST 2012. Contains 205978 sequences.