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 A138262 #13 Jul 09 2025 04:28:45
%S A138262 1,2,1,2,2,11,5,2,1,2,10,11,19,13,11,11,7,11,28,2,13,10,6,11,11,19,3,
%T A138262 13,15,11,61,13,11,8,13,11,19,28,19,2,4,13,60,10,11,12,24,11,5,11,41,
%U A138262 19,79,82,10,13,28,15,233,11,10,61,13,17,19,11,12,8,12,13,36,11,13,19,11,37
%N A138262 Smallest positive integer m such that n divides [9^m/m] (=A129799(m)).
%C A138262 This sequence is well-defined.
%H A138262 Romanian Master in Mathematics Contest, <a href="https://artofproblemsolving.com/community/c6h187665">Problem 3</a>, Bucharest, 2007.
%t A138262 spi[n_]:=Module[{m=1},While[Mod[Floor[9^m/m],n]!=0,m++];m]; Array[spi,80] (* _Harvey P. Dale_, Jul 07 2022 *)
%Y A138262 Cf. A129799, A138255, A138256, A138257, A138258, A138259, A138260, A138261, A138263.
%K A138262 nonn
%O A138262 1,2
%A A138262 _Max Alekseyev_, Mar 09 2008