id:A072084 - OEIS Search Results

Search: id:A072084

Displaying 1-1 of 1 results found.

page 1

A072084

In prime factorization of n replace all primes by their numbers of 1's in binary representation.

+0
4

1, 1, 2, 1, 2, 2, 3, 1, 4, 2, 3, 2, 3, 3, 4, 1, 2, 4, 3, 2, 6, 3, 4, 2, 4, 3, 8, 3, 4, 4, 5, 1, 6, 2, 6, 4, 3, 3, 6, 2, 3, 6, 4, 3, 8, 4, 5, 2, 9, 4, 4, 3, 4, 8, 6, 3, 6, 4, 5, 4, 5, 5, 12, 1, 6, 6, 3, 2, 8, 6, 4, 4, 3, 3, 8, 3, 9, 6, 5, 2, 16, 3, 4, 6, 4, 4, 8, 3, 4, 8, 9, 4, 10, 5, 6 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(n)<n for n>1.` `Multiplicative with a(p^e) = A000120(p)^e - Mitch Harris, Apr 19 2005.`
	FORMULA	`Multiplicative with a(p) = number of 1's in binary representation of prime p.` `Multiplicative with a(p^e) = A000120(p)^e`
	EXAMPLE	`a(30) = a(235) = a(2)a(3)a(5) = 122 = 4,` `as a(2)=a('10')=1, a(3)=a('11')= 2, and a(5)=a('101')=2.`
	CROSSREFS	`Cf. A000120, A072085, A072087.` `Sequence in context: A024160 A103284 A071287 this_sequence A133755 A070104 A131085` `Adjacent sequences: A072081 A072082 A072083 this_sequence A072085 A072086 A072087`
	KEYWORD	`nonn,mult`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jun 14 2002`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research