login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A330068 Numbers k such that Sum_{i=1..k} i^A000010(k) == 2 (mod k). 9
1, 3, 4, 12, 84, 3612, 94116, 4429004844, 104990793204 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Apparently includes the sequence 2*A054377.
Additional terms include 4429004844, 104990793204, and 16980843167119376821413542522172.
a(10) > 10^13. - Giovanni Resta, Feb 27 2020
LINKS
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
PROG
(PARI) isok(n) = sumdiv(n, d, eulerphi(n/d) * Mod(d, n)^eulerphi(n)) == 2; \\ Daniel Suteu, Jan 13 2020
CROSSREFS
Sequence in context: A018930 A127689 A307077 * A127690 A092417 A071543
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
a(8)-a(9) from Giovanni Resta, Feb 27 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 17:00 EDT 2024. Contains 371749 sequences. (Running on oeis4.)