This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A372905 #9 Jun 11 2024 09:45:10
%S A372905 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,
%T A372905 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,
%U A372905 2,2,2,2,4,8,38,2,2,2,10,2,4,2,2,10,4,2
%N A372905 Number of solutions for A330279 (numbers k such that x^k == k (mod k + 1) has multiple solutions for 0 <= x < k).
%t A372905 Select[Table[Count[Table[PowerMod[x, k, k + 1], {x, 1, k - 1}], k], {k, 1, 813}], # >= 2 &]
%Y A372905 Cf. A330279.
%K A372905 nonn
%O A372905 1,1
%A A372905 _Robert P. P. McKone_, May 16 2024