The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A343930 Numbers k such that Sum_{j=1..k} (-j)^j == 1 (mod k). 2
1, 2, 30, 33, 37, 83, 149, 262, 4030, 31969, 140225, 182730, 724754, 2337094, 3985753, 4195221, 4541725 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
q[n_] := n == 1 || Mod[Sum[PowerMod[-k, k, n], {k, 1, n}], n] == 1; Select[Range[5000], q] (* Amiram Eldar, May 04 2021 *)
PROG
(PARI) isok(n) = sum(k=1, n, Mod(-k, n)^k)==1;
CROSSREFS
Sequence in context: A073418 A022377 A145290 * A127026 A105962 A113695
KEYWORD
nonn,more
AUTHOR
Seiichi Manyama, May 04 2021
EXTENSIONS
a(11)-a(13) from Chai Wah Wu, May 04 2021
a(14) from Martin Ehrenstein, May 05 2021
a(15)-a(17) from Martin Ehrenstein, May 08 2021
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 May 16 14:39 EDT 2024. Contains 372554 sequences. (Running on oeis4.)