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 A138256 #13 Jul 09 2025 04:28:19
%S A138256 1,2,1,2,4,5,13,5,3,4,6,5,7,13,13,5,16,10,15,4,13,11,15,5,22,7,9,13,
%T A138256 30,13,33,17,11,16,13,10,19,37,7,13,8,13,55,11,14,67,35,5,43,22,82,7,
%U A138256 108,92,20,13,37,30,120,13,11,33,26,17,14,11,23,16,24,13,72,10,13,19,22,37
%N A138256 Smallest positive integer m such that n divides [3^m/m] (=A092763(m)).
%C A138256 This sequence is well-defined.
%H A138256 Romanian Master in Mathematics Contest, Bucharest, 2007, <a href="https://artofproblemsolving.com/community/c6h187665">Problem 3</a>
%t A138256 pim[n_]:=Module[{m=1},While[!Divisible[Floor[3^m/m],n],m++];m]; Array[pim, 80] (* _Harvey P. Dale_, Oct 26 2011 *)
%Y A138256 Cf. A092763, A138255, A138257, A138258, A138259, A138260, A138261, A138262, A138263.
%K A138256 nonn
%O A138256 1,2
%A A138256 _Max Alekseyev_, Mar 09 2008