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.

A130669 Smallest k such that phi(x) = k has exactly n odd solutions.

Original entry on oeis.org

1, 6, 24, 60, 144, 72, 216, 480, 600, 240, 432, 1152, 1296, 1080, 4608, 2016, 720, 2520, 2400, 1440, 5184, 4032, 2880, 5280, 7776, 2160, 5760, 21840, 7560, 9600, 6720, 16560, 5040, 15552, 6480, 13440, 10800, 11520, 20736, 4320, 18144, 12096, 28512, 16800
Offset: 1

Views

Author

Franz Vrabec, Jun 27 2007

Keywords

Examples

			a(3) = 24 because there are 3 odd solutions (35, 39, 45) to phi(x) = 24 and for every k < 24 the number of odd solutions to phi(x) = k is unequal to 3.
		

Crossrefs