id:A136566 - OEIS Search Results

Search: id:A136566

Displaying 1-1 of 1 results found.

page 1

a(n) = sum of the exponents occurring only once each in the prime-factorization of n.

+0
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; 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	`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.` `Adjacent sequences: A136563 A136564 A136565 this_sequence A136567 A136568 A136569` `Sequence in context: A047265 A100995 A129353 this_sequence A048983 A118344 A119270`
	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 January 7 17:35 EST 2009. Contains 152824 sequences.

AT&T Labs Research