id:A050377 - OEIS Search Results

Search: id:A050377

Displaying 1-1 of 1 results found.

page 1

Number of ways to factor n into members of A050376.

+0
3

1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 2, 4, 1, 1 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24=2^33 and 375=35^3 both have prime signature (3,1).` `Multiplicative with a(p^e) = ???. Christian G. Bower (bowerc(AT)usa.net) May 16, 2005.` `Multiplicative with a(p^e) = A018819(e). Christian G. Bower (bowerc(AT)usa.net) and David W. Wilson (davidwwilson(AT)comcast.net) May 22, 2005.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000`
	FORMULA	`Dirichlet g.f.: prod{n in A050376}(1/(1-1/n^s)).` `a(n) = Sum{a(d): d^2 divides n}, a(1) = 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 12 2007`
	CROSSREFS	`Cf. A001055, A050376-A050380. a(p^k)=A000123([k/2]). a(A002110)=1.` `Sequence in context: A049419 A046951 A159631 this_sequence A001826 A003641 A165190` `Adjacent sequences: A050374 A050375 A050376 this_sequence A050378 A050379 A050380`
	KEYWORD	`nonn,mult`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research