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.

A241978 Numbers n such that 6^phi(n) == 1 (modulo n^2), where phi(n) is Euler's totient function.

Original entry on oeis.org

66161, 330805, 534851, 2674255, 3152573, 10162169, 13371275, 50810845, 54715147, 129255493, 148170931, 254054225, 273575735, 301121113, 383006029, 646277465, 1289402357, 1505605565, 1915030145, 3228193673, 3407931413, 5721301147, 6075008171, 7528027825
Offset: 1

Views

Author

Felix Fröhlich, Aug 10 2014

Keywords

Comments

a(17) > 10^9.

Crossrefs

Programs

  • Mathematica
    Select[Range[65*10^7],PowerMod[6,EulerPhi[#],#^2]==1&] (* Harvey P. Dale, Jan 20 2020 *)
  • PARI
    for(n=2, 1e9, if(Mod(6, n^2)^(eulerphi(n))==1, print1(n, ", ")))

Extensions

Terms a(17) and beyond from Giovanni Resta, Jan 24 2020