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!)
A372905 Number of solutions for A330279 (numbers k such that x^k == k (mod k + 1) has multiple solutions for 0 <= x < k). 0
2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 8, 2, 2, 6, 2, 2, 4, 2, 10, 2, 14, 2, 2, 2, 2, 2, 6, 8, 4, 8, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 14, 4, 2, 2, 26, 2, 6, 2, 2, 2, 2, 4, 2, 14, 2, 6, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 8, 38, 2, 2, 2, 10, 2, 4, 2, 2, 10, 4, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
Select[Table[Count[Table[PowerMod[x, k, k + 1], {x, 1, k - 1}], k], {k, 1, 813}], # >= 2 &]
CROSSREFS
Cf. A330279.
Sequence in context: A289827 A092188 A340675 * A356497 A097884 A094818
KEYWORD
nonn
AUTHOR
Robert P. P. McKone, May 16 2024
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 September 17 15:47 EDT 2024. Contains 375987 sequences. (Running on oeis4.)