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 A383766 #35 May 23 2025 23:00:40
%S A383766 1,1,2,1,2,2,3,1,4,2,3,2,6,3,4,2,5,4,7,2,6,3,8,2,10,6,11,3,12,4,11,4,
%T A383766 6,5,6,4,13,7,12,2,11,6,16,3,8,8,13,4,21,10,10,6,17,11,6,3,14,12,18,4,
%U A383766 20,11,12,8,12,6,27,5,16,6,26,4,27,13,20,7,9,12,26,4,31,11,25
%N A383766 a(n) is the number of numbers k (0 <= k < n) such that there exist solutions of x^3 + x == y^2 + 1 == k (mod n).
%H A383766 SiYang Hu, <a href="/A383766/b383766.txt">Table of n, a(n) for n = 1..10000</a>
%F A383766 If 8 does not divide n, a(2n) = a(n).
%F A383766 If 8 divides n, a(2n) = 2*a(n).
%e A383766 a(7) = 3: k can be 2, 3, 5, for example, when k = 3, x = 2, and y = 4, the equation is satisfied.
%t A383766 A383766 = Table[Count[Range[0, n - 1], k_ /; Length[Solve[{x^3 + x == k, y^2 + 1 == k}, {x, y}]] > 0], {n, 1, 50}];
%K A383766 nonn
%O A383766 1,3
%A A383766 _SiYang Hu_, May 09 2025