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 A337910 #18 Sep 08 2022 08:46:25 %S A337910 1,1,3,3,1,3,3,5,3,1,3,9,1,3,3,5,1,3,3,3,9,3,3,15,1,1,3,9,1,3,3,5,9,1, %T A337910 3,9,1,3,3,5,1,9,3,9,3,3,3,15,3,1,3,3,1,3,3,15,9,1,3,9,1,3,9,5,1,9,3, %U A337910 3,9,3,3,15,1,1,3,9,9,3,3,5,3,1,3,27,1,3,3,15,1,3,3,9,9,3,3,15 %N A337910 Integers of the form (the number of nonnegative bases m < n such that m^3 == m (mod n))/(the number of nonnegative bases m < n such that -m^3 == m (mod n)). %C A337910 All members of a(n) are odd numbers. For n > 3, 1 <= a(n) < n. %o A337910 (Magma) [#[m: m in [0..n-1] | m^3 mod n eq m]/#[m: m in [0..n-1] | -m^3 mod n eq m]: n in [1..96]]; %Y A337910 Cf. A026741, A008784, A002313, A002145, A334006. %K A337910 nonn,easy %O A337910 1,3 %A A337910 _Juri-Stepan Gerasimov_, Sep 29 2020