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 A138260 #11 Jul 09 2025 04:28:32
%S A138260 1,2,2,2,4,2,1,2,13,4,20,2,12,11,4,11,16,13,3,4,11,20,67,2,4,12,19,11,
%T A138260 43,4,60,13,20,16,13,13,9,3,12,4,10,11,6,20,13,67,66,11,7,4,16,12,79,
%U A138260 19,20,11,3,43,78,4,51,60,13,17,12,20,75,16,67,13,52,13,24,9,4,6,31,12,35
%N A138260 Smallest positive integer m such that n divides [7^m/m] (=A129797(m)).
%C A138260 This sequence is well-defined.
%H A138260 Harvey P. Dale, <a href="/A138260/b138260.txt">Table of n, a(n) for n = 1..1000</a>
%H A138260 Romanian Master in Mathematics Contest, <a href="https://artofproblemsolving.com/community/c6h187665">Problem 3</a>, Bucharest, 2007.
%t A138260 spi[n_]:=Module[{m=1},While[Mod[Floor[7^m/m],n]!=0,m++];m]; Array[spi,80] (* _Harvey P. Dale_, Aug 16 2018 *)
%Y A138260 Cf. A129797, A138255, A138256, A138257, A138258, A138259, A138261, A138262, A138263.
%K A138260 nonn
%O A138260 1,2
%A A138260 _Max Alekseyev_, Mar 09 2008