id:A049599 - OEIS Search Results

Search: id:A049599

Displaying 1-1 of 1 results found.

page 1

Number of (1+e)-divisors of n: if n = Product p(i)^r(i), d = Product p(i)^s(i) and s(i) = 0 or s(i) divides r(i), then d is a (1+e)-divisor of n.

+0
7

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

	OFFSET	`1,2`
	FORMULA	`If n = Product p(i)^r(i) then a(n) = Product (tau(r(i))+1), where tau(n) = number of divisors of n, cf. A000005. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 29 2001`
	CROSSREFS	`Cf. A049603, A051378.` `Sequence in context: A106491 A073184 A073182 this_sequence A043261 A157986 A025479` `Adjacent sequences: A049596 A049597 A049598 this_sequence A049600 A049601 A049602`
	KEYWORD	`nonn,easy,nice,mult`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)`
	EXTENSIONS	`More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Apr 12 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research