id:A062513 - OEIS Search Results

Search: id:A062513

Displaying 1-1 of 1 results found.

page 1

Product of unitary divisors of n is divided by n^(number of distinct prime factors).

+0
1

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 60, 1, 1, 1, 1, 1, 66, 1, 1, 1, 70, 1, 1, 1, 1, 1, 1, 1, 78, 1, 1, 1, 1, 1, 84, 1, 1, 1, 1, 1, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,30`
	FORMULA	`a(n)=A061537(n)/[n^A001221(n)]=n^[(A034444(n)/2)-A001221(n)]`
	EXAMPLE	`n=210, with 4 p-divisors; all its 16 divisors are unitary; product=210^(16/2)=3782285936100000000, while 210^4=1944810000; a(210)=3782285936100000000/1944810000=1944810000`
	CROSSREFS	`A000005, A034444, A001221.` `Sequence in context: A030128 A137348 A137737 this_sequence A040906 A040907 A040908` `Adjacent sequences: A062510 A062511 A062512 this_sequence A062514 A062515 A062516`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 13 2001`

page 1

Search completed in 0.002 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research