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.

A071571 Smallest number whose square has exactly 2n+1 divisors.

Original entry on oeis.org

1, 2, 4, 8, 6, 32, 64, 12, 256, 512, 24, 2048, 36, 30, 16384, 32768, 96, 72, 262144, 192, 1048576, 2097152, 60, 8388608, 216, 768, 67108864, 288, 1536, 536870912, 1073741824, 120, 576, 8589934592, 6144, 34359738368, 68719476736, 180, 864
Offset: 0

Views

Author

Lekraj Beedassy, May 31 2002

Keywords

Comments

Only squares have an odd number of divisors.

Examples

			a(4)=6 because it is the smallest number followed by 10,14,15,16,21,22,... whose squares have 2*4 + 1, i.e., 9 divisors.
		

Crossrefs

Cf. A005179.
Identical to A016017 shifted left.

Programs

  • PARI
    a(n) = {k = 1; while (numdiv(k^2) != (2*n+1), k++); return (k);} \\ Michel Marcus, Jul 27 2013

Formula

a(n) <= 2^n, where the equality holds if and only if n=0 or 2n+1 is prime. - Jianing Song, Aug 30 2021

Extensions

More terms from Vladeta Jovovic, Jun 05 2002
a(0) prepended by Jianing Song, Aug 30 2021