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.

A330068 Numbers k such that Sum_{i=1..k} i^A000010(k) == 2 (mod k).

Original entry on oeis.org

1, 3, 4, 12, 84, 3612, 94116, 4429004844, 104990793204
Offset: 1

Views

Author

Keywords

Comments

Apparently includes the sequence 2*A054377.
Additional terms include 4429004844, 104990793204, and 16980843167119376821413542522172.
a(10) > 10^13. - Giovanni Resta, Feb 27 2020

Crossrefs

Programs

  • Mathematica
    G[n_, k_] := G[n, k] = Mod[Sum[PowerMod[i, k, n], {i, 1, n}], n];
    Select[Range[2000], G[#, EulerPhi[#]] == 2 &]
    fa=FactorInteger;
    se[n_, k_] := Select[Transpose[fa[n]][[1]], IntegerQ[k/(# - 1)] &];
    sumlis[li_] := Sum[li[[i]], {i, 1, Length[li]}]
    Table[If[Mod[-n/se[n, EulerPhi[n]] // sumlis, n] == 2, n], {n, 1, 1000000}] // Union
  • PARI
    isok(n) = sumdiv(n, d, eulerphi(n/d) * Mod(d, n)^eulerphi(n)) == 2; \\ Daniel Suteu, Jan 13 2020

Extensions

a(8)-a(9) from Giovanni Resta, Feb 27 2020