id:A061142 - OEIS Search Results

Search: id:A061142

Displaying 1-1 of 1 results found.

page 1

Replace each prime factor of n by 2.

+0
5

1, 2, 2, 4, 2, 4, 2, 8, 4, 4, 2, 8, 2, 4, 4, 16, 2, 8, 2, 8, 4, 4, 2, 16, 4, 4, 8, 8, 2, 8, 2, 32, 4, 4, 4, 16, 2, 4, 4, 16, 2, 8, 2, 8, 8, 4, 2, 32, 4, 8, 4, 8, 2, 16, 4, 16, 4, 4, 2, 16, 2, 4, 8, 64, 4, 8, 2, 8, 4, 8, 2, 32, 2, 4, 8, 8, 4, 8, 2, 32, 16, 4, 2, 16, 4, 4, 4, 16, 2, 16, 4, 8, 4, 4, 4 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000`
	FORMULA	`a(n)=sum( d divides n, 2^(bigomega(d)-omega(d)))=sum( d divides n, 2^(A001222(d)-A001221(d))) - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 30 2002` `a(n) = A000079(A001222(n)), i.e. a(n)=2^bigomega(n). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 13 2005` `Totally multiplicative with a(p) = 2. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 04 2006`
	EXAMPLE	`a(100)=16 since 100=2255 and so a(100)=2222.`
	MAPLE	`with(numtheory): seq(2^bigomega(n), n=1..95);`
	CROSSREFS	`Cf. A001222, A000079, A123667.` `Cf. A034444, A124508.` `Sequence in context: A101113 A055155 A085191 this_sequence A091248 A082991 A100008` `Adjacent sequences: A061139 A061140 A061141 this_sequence A061143 A061144 A061145`
	KEYWORD	`easy,nonn,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), May 29 2001`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research