cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A294528 a(n) is the smallest prime that begins a run of exactly n consecutive numbers having 2, 4, ..., 2*n divisors.

Original entry on oeis.org

2, 5, 61, 421, 1524085621
Offset: 1

Views

Author

Jon E. Schoenfield, Nov 01 2017

Keywords

Comments

No such run exists for any n > 5; for a proof, see Links.

Examples

			a(3) = 61 because 61 (prime), 62 = 2*31, and 63 = 3^2*7 have 2, 4, and 6 divisors, respectively (and 64 does not have exactly 8 divisors, so 63 is the last number in the run), and there is no smaller number having this property.
a(5) = 1524085621 because the 5 consecutive integers 1524085621..1524085625 have 2, 4, 6, 8, and 10 divisors, respectively (and 1524085626 does not have exactly 12 divisors), and there is no smaller number having this property.
		

Crossrefs