id:A061389 - OEIS Search Results

Search: id:A061389

Displaying 1-1 of 1 results found.

page 1

Number of (1+phi)-divisors of n.

+0
5

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

	OFFSET	`1,2`
	COMMENT	`d is called a (1+phi)-divisor of a number n with prime factorization n = Product p(i)^r(i) if d\|n and d = Product p(i)^s(i), where s(i)=0 or GCD(s(i),r(i))=1.` `a(n) is odd iff n is a 3-full number (cf. A036966).`
	FORMULA	`Multiplicative with a(p^e) = A000010(e)+1.`
	CROSSREFS	`Cf. A069915, A049419, A049599.` `Sequence in context: A028326 A048003 A098219 this_sequence A138011 A036555 A046927` `Adjacent sequences: A061386 A061387 A061388 this_sequence A061390 A061391 A061392`
	KEYWORD	`nonn,mult`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 29 2001`

page 1

Search completed in 0.002 seconds

Last modified August 28 19:25 EDT 2008. Contains 143183 sequences.

AT&T Labs Research