id:A051119 - OEIS Search Results

Search: id:A051119

Displaying 1-1 of 1 results found.

page 1

n/p^k, where p = largest prime dividing n and p^k = highest power of p dividing n.

+0
2

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

	OFFSET	`1,6`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000` `Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`a(36) = 4 because 36/3^2 = 4, 3^2 is highest power dividing 36 of largest prime dividing 36.` `a(50) = 50 / 5^2 = 2.`
	CROSSREFS	`Equals n/A053585(n).` `Sequence in context: A167204 A104306 A074389 this_sequence A159269 A009191 A114717` `Adjacent sequences: A051116 A051117 A051118 this_sequence A051120 A051121 A051122`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Leroy Quet`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 21 2000`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research