id:A136565 - OEIS Search Results

Search: id:A136565

Displaying 1-1 of 1 results found.

page 1

a(n) = sum of the distinct values making up the exponents in the prime-factorization of n.

+0
3

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; listen)

	OFFSET	`1,4`
	LINKS	`Diana Mecum, Table of n, a(n) for n = 1..1000` `Leroy Quet, Home Page (listed in lieu of email address)`
	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 this_sequence A086291 A016442 A076360` `Adjacent sequences: A136562 A136563 A136564 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research