id:A046665 - OEIS Search Results

Search: id:A046665

Displaying 1-1 of 1 results found.

page 1

Largest prime divisor of n - smallest prime divisor of n (a(1)=0).

+0
12

0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 5, 2, 0, 0, 1, 0, 3, 4, 9, 0, 1, 0, 11, 0, 5, 0, 3, 0, 0, 8, 15, 2, 1, 0, 17, 10, 3, 0, 5, 0, 9, 2, 21, 0, 1, 0, 3, 14, 11, 0, 1, 6, 5, 16, 27, 0, 3, 0, 29, 4, 0, 8, 9, 0, 15, 20, 5, 0, 1, 0, 35, 2, 17, 4, 11, 0, 3, 0, 39, 0, 5, 12, 41, 26, 9, 0, 3, 6, 21, 28, 45 (list; graph; listen)

	OFFSET	`1,10`
	REFERENCES	`Handbook of Number Theory, D. S. Mitrinovic et al., Kluwer, Section IV.1.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Cf. A074320, A066048, A130064, A130065.` `Sequence in context: A100257 A100573 A049087 this_sequence A100574 A056100 A136689` `Adjacent sequences: A046662 A046663 A046664 this_sequence A046666 A046667 A046668`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 19 08:04 EDT 2008. Contains 142098 sequences.

AT&T Labs Research