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.

A386284 Smallest k for which A386930(k) = n.

This page as a plain text file.
%I A386284 #15 Aug 22 2025 08:53:01
%S A386284 1,2,4,8,18,45,36,90,72,108,144,315,216,540,576,432,648,1350,864,2160,
%T A386284 1296,1728,4050,2700,2592,3888,6912,11340,5184,5400,7776,10395,10368,
%U A386284 13500,20790,10800,23328,24300,16200,31185,31104,21600,27000,40500,62208,56700
%N A386284 Smallest k for which A386930(k) = n.
%t A386284 a386930[n_] := DivisorSum[n, 1 &, PowerMod[-#, #, n] == Mod[-PowerMod[#, #, n], n] &];a[n_]:=Module[{k=0},Until[a386930[k]==n,k++];k];Array[a,46] (* _James C. McMahon_, Aug 21 2025 *)
%Y A386284 Cf. A385638, A386930.
%K A386284 nonn,new
%O A386284 1,2
%A A386284 _Juri-Stepan Gerasimov_, Aug 14 2025