A372905 Number of solutions for A330279 (numbers k such that x^k == k (mod k + 1) has multiple solutions for 0 <= x < k).

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

Offset: 1

Author

Robert P. P. McKone, May 16 2024

Keywords

• nonn

Crossrefs

Cf. A330279.

Programs

Mathematica

Select[Table[Count[Table[PowerMod[x, k, k + 1], {x, 1, k - 1}], k], {k, 1, 813}], # >= 2 &]