id:A134598 - OEIS Search Results

Search: id:A134598

Displaying 1-1 of 1 results found.

page 1

Sum of digital sums (base 2) of the prime factors of n.

+0
2

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

	OFFSET	`2,2`
	FORMULA	`If p_1p_2p_3* ... *p_m=n is the unique prime factorization of n, then a(n)=sum{1<=k<=m, ds_2(p_k)}, where ds_2 is the digital sum base 2.`
	EXAMPLE	`a(6)=3, since 6=2*3 and so a(6)=ds_2(2)+ds_2(3)=1+2.`
	CROSSREFS	`Cf. A007953, A118503, A134599.` `Adjacent sequences: A134595 A134596 A134597 this_sequence A134599 A134600 A134601` `Sequence in context: A022870 A131410 A080773 this_sequence A064515 A112754 A045864`
	KEYWORD	`nonn,base`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Nov 11 2007`

page 1

Search completed in 0.002 seconds

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.

AT&T Labs Research