id:A052126 - OEIS Search Results

Search: id:A052126

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n>1, a(n)=n/(largest prime dividing n).

+0
14

1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 8, 5, 2, 9, 4, 1, 6, 1, 16, 3, 2, 5, 12, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 7, 10, 3, 4, 1, 18, 5, 8, 3, 2, 1, 12, 1, 2, 9, 32, 5, 6, 1, 4, 3, 10, 1, 24, 1, 2, 15, 4, 7, 6, 1, 16, 27, 2, 1, 12, 5, 2, 3, 8, 1, 18, 7, 4, 3, 2, 5, 32, 1 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000`
	FORMULA	`n/A006530(n).` `a(n) = A130065(n)/A020639(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 05 2007`
	EXAMPLE	`a(15) = 15/(largest prime dividing 15) = 15/5=3.`
	MAPLE	`with(numtheory): a:=proc(n) local u: if n=1 then 1 else u:=factorset(n): n/max(seq(u[j], j=1..nops(u))) end if end proc: seq(a(n), n=1..100); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2008`
	CROSSREFS	`Cf. A006530, A032742.` `Sequence in context: A164879 A009195 A072994 this_sequence A094521 A159272 A098372` `Adjacent sequences: A052123 A052124 A052125 this_sequence A052127 A052128 A052129`
	KEYWORD	`nonn`
	AUTHOR	`James A. Sellers (sellersj(AT)math.psu.edu), Jan 21 2000`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research