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.

Showing 1-1 of 1 results.

A171783 Third smallest divisor of smallest number having exactly n divisors.

Original entry on oeis.org

4, 3, 4, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4
Offset: 3

Views

Author

J. Lowell, Oct 12 2010

Keywords

Comments

Conjecture: a(n) = 4 for all prime numbers >= 3 and 3 for all composites
Third column of triangle in A081532. - N. J. A. Sloane, Oct 12 2010.

Examples

			a(4) = 3 because the divisors of 6 are 1, 2, 3, 6.

Links

Crossrefs

Cf. A081532, A171784. - N. J. A. Sloane, Oct 12 2010.
Cf. A005179, A292269.

Formula

a(n) = A292269(A005179(n)) for n >= 3. - Antti Karttunen, Oct 04 2017

Extensions

More terms from R. J. Mathar, Oct 13 2010
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.