cp's OEIS Frontend

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.

A386436 Smallest k for which A385731(k) = n.

This page as a plain text file.
%I A386436 #12 Aug 06 2025 12:04:10
%S A386436 1,2,6,42,1770,47058,547470,8648458,623254170
%N A386436 Smallest k for which A385731(k) = n.
%t A386436 a[n_]:=Module[{k=0},Until[Length[Select[Divisors[k], Mod[-#, k]==PowerMod[-#, #, k]==PowerMod[#, #, k]&]]==n,k++];k];Array[a,7] (* _James C. McMahon_, Aug 06 2025 *)
%Y A386436 Cf. A385729, A385731, A386410.
%K A386436 nonn,more
%O A386436 1,2
%A A386436 _Juri-Stepan Gerasimov_ and _Michel Marcus_, Jul 21 2025
%E A386436 a(9) from _Michel Marcus_, Jul 21 2025