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 A138259 #10 Jun 06 2025 08:36:12
%S A138259 1,1,1,3,5,1,11,3,2,7,21,3,20,11,7,6,40,2,10,219,11,21,20,3,11,20,4,
%T A138259 119,15,7,7,6,31,40,11,3,13,37,33,219,42,11,7,130,38,20,33,6,15,11,57,
%U A138259 20,79,4,21,119,10,15,60,219,62,7,38,9,37,31,50,259,49,11,211,3,37,13,11,219
%N A138259 Smallest positive integer m such that n divides [6^m/m] (=A129796(m)).
%C A138259 This sequence is well-defined.
%H A138259 Romanian Master in Mathematics Contest, <a href="https://artofproblemsolving.com/community/c6h187665">Problem 3</a>, Bucharest, 2007.
%t A138259 a[n_]:=Module[{m=1},While[!Divisible[Floor[6^m/m],n],m++];m];Array[a,76] (* _James C. McMahon_, Jun 05 2025 *)
%Y A138259 Cf. A129796, A138255, A138256, A138257, A138258, A138260, A138261, A138262, A138263.
%K A138259 nonn
%O A138259 1,4
%A A138259 _Max Alekseyev_, Mar 09 2008