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.

A085758 Least m such that phi(x)=2m has exactly n solutions.

Original entry on oeis.org

5, 1, 2, 4, 6, 16, 18, 20, 12, 24, 80, 198, 1134, 352, 156, 36, 168, 108, 468, 72, 312, 528, 880, 180, 1280, 192, 144, 660, 1848, 120, 384, 4500, 216, 3564, 2100, 240, 288, 648, 600, 7968, 1656, 1536, 1620, 432, 1560, 3672, 1944, 360, 840, 2496, 8820, 1008, 576
Offset: 2

Views

Author

Lekraj Beedassy, Jul 22 2003

Keywords

Comments

Sequence refers to the rank of the first occurrence of n in A032446.

Examples

			a(0) = 7. Carmichael conjectured that a(1) doesn't exist.
		

Crossrefs

Cf. A032446.

Formula

a(n) = A007374(n)/2 for n > 2. - David Wasserman, Feb 09 2005

Extensions

More terms from David Wasserman, Feb 09 2005