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 A247229 #22 Mar 03 2020 09:01:28
%S A247229 3,7,11,127,89,8191,30839,363889,178481,2089,4404047,616318177,
%T A247229 164511353,2099863,13264529,20394401
%N A247229 Minimum of the greatest prime factors of (i^prime(n)-1)/(i-1), when i runs through all integers in [2, prime(n)].
%C A247229 If in the definition "greatest" is replaced with "smallest", then we obtain A035095 (see comment there).
%F A247229 a(n) == 1 (mod prime(n)).
%o A247229 (PARI) a(n) = {mini = 0; p = prime(n); for (i=2, p, f = factor((i^p-1)/(i-1)); gpf = f[#f~, 1]; if (! mini, mini = gpf, mini = min(mini, gpf));); mini;} \\ _Michel Marcus_, Dec 09 2014
%Y A247229 Cf. A035095, A247216.
%K A247229 nonn,more
%O A247229 1,1
%A A247229 _Vladimir Shevelev_, Nov 27 2014
%E A247229 More terms from _Peter J. C. Moses_, Nov 27 2014
%E A247229 a(13)-a(14) from _Michel Marcus_, Dec 09 2014
%E A247229 a(15)-a(16) from _Jinyuan Wang_, Mar 03 2020