id:A125071 - OEIS Search Results

Search: id:A125071

Displaying 1-1 of 1 results found.

page 1

a(n) = sum of the exponents in the prime-factorization of n which are not primes.

+0
2

0, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 1, 1, 2, 2, 4, 1, 1, 1, 1, 2, 2, 1, 1, 0, 2, 0, 1, 1, 3, 1, 0, 2, 2, 2, 0, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 1, 5, 0, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 6, 2, 3, 1, 1, 2, 3, 1, 0, 1, 2, 1, 1, 2, 3, 1, 5, 4, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 0, 1, 3, 1, 1, 3 (list; graph; listen)

	OFFSET	`1,6`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`720 has the prime-factorization of 2^4 3^2 5^1. Two of these exponents, 4 and` `1, aren't primes. So a(720) = 4 + 1 = 5.`
	MATHEMATICA	`f[n_] := Plus @@ Select[Last /@ FactorInteger[n], ! PrimeQ[ # ] &]; Table[f[n], {n, 110}] (Chandler)`
	CROSSREFS	`Cf. A125070.` `Sequence in context: A050326 A056169 A125070 this_sequence A161528 A136176 A103344` `Adjacent sequences: A125068 A125069 A125070 this_sequence A125072 A125073 A125074`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet, Nov 18 2006`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2006`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research