login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A348059
a(n) = Min {k > n : A235137(k) == -n (mod k)}, or -1 if no such minimum exists.
10
2, 4, 9, 8, 6, 180, 10, 15, 14, 12, 121, 35, 22, 20, 18, 32, 289, 28, 34, 24, 38, 57, 529, 45, 46, 44, 81, 40, 546, 36, 58, 64, 62, 93, 50, 56, 210, 68, 74, 48, 42, 76, 82, 123, 54, 129, 510, 117, 94, 92, 3376098, 88, 690, 329, 106, 80, 2898, 265, 70, 72, 66
OFFSET
1,1
COMMENTS
Conjecture: For all n, a(n) > 0.
MATHEMATICA
Giuga1[mu_][n_] := Giuga1[mu][n] =
Mod[Sum[PowerMod[i, EulerPhi[n], n], {i, 1, n}] + mu, n] == 0;
A348059[n_] := A348059[n] =
{Clear[ww]; Do[If[Giuga1[n][i], ww = i; Break[]], {i, n + 1, 20000000}]; ww} [[1]];
Table[A348059[n], {n, 49}]
PROG
(PARI) a(n) = my(k=n+1); while (sum(i=1, k , Mod(i, k)^eulerphi(k)) != -n, k++); k; \\ Michel Marcus, Sep 28 2021
CROSSREFS
Sequence in context: A055858 A141389 A378389 * A076125 A011033 A179219
KEYWORD
nonn
AUTHOR
STATUS
approved