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.

A332516 Numbers k such that phi(k) == 10 (mod 12), where phi is the Euler totient function (A000010).

Original entry on oeis.org

11, 22, 23, 46, 47, 59, 71, 83, 94, 107, 118, 131, 142, 166, 167, 179, 191, 214, 227, 239, 251, 262, 263, 311, 334, 347, 358, 359, 382, 383, 419, 431, 443, 454, 467, 478, 479, 491, 502, 503, 526, 563, 587, 599, 622, 647, 659, 683, 694, 718, 719, 743, 766, 827
Offset: 1

Views

Author

Amiram Eldar, Feb 14 2020

Keywords

Comments

Dence and Pomerance showed that the asymptotic number of the terms below x is ~ (3/8) * x/log(x).

Examples

			23 is a term since phi(23) = 22 == 10 (mod 12).
		

Crossrefs

Programs

  • Magma
    [k:k in [1..850]| EulerPhi(k) mod 12 eq 10]; // Marius A. Burtea, Feb 14 2020
  • Mathematica
    Select[Range[800], Mod[EulerPhi[#], 12] == 10 &]