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 A211411 #21 Sep 15 2015 16:27:15 %S A211411 18,18,43,18,33,63,55,69,86,101,16,50,102,165,64,210,153,225,259,177, %T A211411 40,247,252,220,225,122,343,297,230,303,375,316,366,74,300,311,410, %U A211411 463,400,370,442,188,395,377,458,426,274,327,546,334,383,324,495,498,457,643,444,553,506,359,712,502,681,369,514 %N A211411 Largest m associated with n-th Pillai prime (A063980). %H A211411 Charles R Greathouse IV, <a href="/A211411/b211411.txt">Table of n, a(n) for n = 1..10000</a> %H A211411 G. E. Hardy and M. V. Subbarao, <a href="http://www.math.ualberta.ca/~subbarao/documents/2002_Pillai.pdf">A modified problem of Pillai and some related questions</a>, Amer. Math. Monthly 109:6 (2002), pp. 554-559. %F A211411 19 <= a(n) <= p-7 for n > 11, where p = A063980(n). %o A211411 (PARI) last(p)=if(p==23,18,my(t=Mod(1/120,p));forstep(m=p-6,8,-1,t/=m; if(t==-1,return(m-1)))) %o A211411 Pillai(p)=my(t=Mod(5040, p)); for(m=8, p-2, t*=m; if(t==-1 && p%m!=1, return(1))); 0 %o A211411 apply(last, select(Pillai, primes(300))) %Y A211411 Trivially a(n) >= A063828(n). Cf. A063980. %K A211411 nonn %O A211411 1,1 %A A211411 _Charles R Greathouse IV_, Feb 10 2013