id:A062760 - OEIS Search Results

Search: id:A062760

Displaying 1-1 of 1 results found.

page 1

n divided by the largest power of the squarefree kernel of n (A007947) which divides it.

+0
3

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 1, 8, 1, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 5, 2, 1, 1, 1, 8, 1, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 16, 1, 7, 3, 1, 1, 1, 1, 4 (list; graph; listen)

	OFFSET	`1,12`
	COMMENT	`a(n) divides A003557 but is not equal to it.`
	FORMULA	`a(n)=n/(A007947(n)^A051904(n))`
	EXAMPLE	`n=1800: the squarefree kernel is 2.3.5=30 and 900=30^2 divides n, a(1800)=2, the quotient.`
	CROSSREFS	`A001694, A007497, A051904, A003557, A052485.` `Sequence in context: A069283 A033630 A101446 this_sequence A014649 A070084 A060176` `Adjacent sequences: A062757 A062758 A062759 this_sequence A062761 A062762 A062763`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 16 2001`

page 1

Search completed in 0.002 seconds

Last modified December 4 15:47 EST 2008. Contains 151279 sequences.

AT&T Labs Research