A145343 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A145343

a(n) = largest prime <= the smallest positive integer with exactly n divisors.

2, 3, 5, 13, 11, 61, 23, 31, 47, 1021, 59, 4093, 191, 139, 113, 65521, 179, 262139, 239, 571, 3067, 4194301, 359, 1291, 12281, 887, 953, 268435399, 719, 1073741789, 839, 9209, 196597, 5179, 1259, 68719476731, 786431, 36857, 1669, 1099511627689, 2879 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`2,1`
	COMMENTS	`a(n) = largest prime <= A005179(n).`
	LINKS	`Table of n, a(n) for n=2..42.`
	FORMULA	`a(n) = A007917(A005179(n)). [From Ray Chandler, Oct 12 2008]`
	CROSSREFS	`A005179, A145344` `Sequence in context: A111239 A264745 A251414 * A058592 A268509 A260594` `Adjacent sequences: A145340 A145341 A145342 * A145344 A145345 A145346`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet, Oct 08 2008`
	EXTENSIONS	`More terms from R. J. Mathar and Ray Chandler, Oct 10 2008`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 10:56 EST 2023. Contains 367589 sequences. (Running on oeis4.)