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

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

1,4

COMMENTS

a(n) = A088529(n) = A181591(n) for n: 2 <= n < 24. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 01 2010]

LINKS

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

EXAMPLE

120 = 2^3 * 3^1 * 5^1. The exponents of the prime factorization are therefore 3,1,1. The distinct values which equal these exponents are 1 and 3. So a(120) = 1+3 = 4.

CROSSREFS

Cf. A071625, A136566, A136568.

Sequence in context: A000688 A038538 A088529 * A181591 A183214 A086291

Adjacent sequences:  A136562 A136563 A136564 * A136566 A136567 A136568

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 15 12:25 EST 2012. Contains 205786 sequences.